/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:46:55,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:46:55,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:46:56,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:46:56,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:46:56,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:46:56,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:46:56,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:46:56,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:46:56,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:46:56,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:46:56,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:46:56,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:46:56,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:46:56,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:46:56,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:46:56,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:46:56,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:46:56,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:46:56,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:46:56,035 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:46:56,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:46:56,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:46:56,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:46:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:46:56,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:46:56,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:46:56,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:46:56,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:46:56,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:46:56,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:46:56,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:46:56,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:46:56,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:46:56,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:46:56,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:46:56,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:46:56,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:46:56,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:46:56,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:46:56,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:46:56,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:46:56,060 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:46:56,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:46:56,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:46:56,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:46:56,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:46:56,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:46:56,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:46:56,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:46:56,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:46:56,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:46:56,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:46:56,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:46:56,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:46:56,070 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:46:56,070 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:46:56,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:46:56,070 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:46:56,070 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:46:56,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:46:56,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:46:56,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:46:56,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:46:56,292 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:46:56,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c [2022-04-08 05:46:56,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e136745/c288aa27e5634fc8b98505fa7efc7d08/FLAGf7cdc0d93 [2022-04-08 05:46:56,671 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:46:56,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c [2022-04-08 05:46:56,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e136745/c288aa27e5634fc8b98505fa7efc7d08/FLAGf7cdc0d93 [2022-04-08 05:46:56,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e136745/c288aa27e5634fc8b98505fa7efc7d08 [2022-04-08 05:46:56,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:46:56,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:46:56,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:46:56,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:46:56,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:46:56,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44840935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56, skipping insertion in model container [2022-04-08 05:46:56,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:46:56,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:46:56,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c[490,503] [2022-04-08 05:46:56,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:46:56,895 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:46:56,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c[490,503] [2022-04-08 05:46:56,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:46:56,923 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:46:56,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56 WrapperNode [2022-04-08 05:46:56,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:46:56,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:46:56,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:46:56,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:46:56,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:46:56,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:46:56,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:46:56,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:46:56,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (1/1) ... [2022-04-08 05:46:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:46:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:56,979 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:46:57,006 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:46:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:46:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:46:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:46:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:46:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:46:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:46:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:46:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:46:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:46:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:46:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 05:46:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:46:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:46:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:46:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:46:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:46:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:46:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:46:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:46:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:46:57,073 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:46:57,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:46:57,252 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:46:57,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:46:57,257 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:46:57,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:46:57 BoogieIcfgContainer [2022-04-08 05:46:57,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:46:57,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:46:57,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:46:57,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:46:57,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:46:56" (1/3) ... [2022-04-08 05:46:57,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e11c89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:46:57, skipping insertion in model container [2022-04-08 05:46:57,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:46:56" (2/3) ... [2022-04-08 05:46:57,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e11c89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:46:57, skipping insertion in model container [2022-04-08 05:46:57,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:46:57" (3/3) ... [2022-04-08 05:46:57,272 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound5.c [2022-04-08 05:46:57,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:46:57,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:46:57,314 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:46:57,318 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:46:57,318 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:46:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 05:46:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 05:46:57,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:57,339 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:46:57,339 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 1 times [2022-04-08 05:46:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:57,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321597832] [2022-04-08 05:46:57,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 2 times [2022-04-08 05:46:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:57,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119504672] [2022-04-08 05:46:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:46:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-08 05:46:57,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-08 05:46:57,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-08 05:46:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:46:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-08 05:46:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 05:46:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-08 05:46:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 05:46:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-08 05:46:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 05:46:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-08 05:46:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 05:46:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-08 05:46:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 05:46:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:57,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-08 05:46:57,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:46:57,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-08 05:46:57,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-08 05:46:57,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-08 05:46:57,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-08 05:46:57,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-08 05:46:57,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-08 05:46:57,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-08 05:46:57,653 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,655 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-08 05:46:57,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-08 05:46:57,658 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,661 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-08 05:46:57,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {44#false} is VALID [2022-04-08 05:46:57,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,662 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-08 05:46:57,663 INFO L272 TraceCheckUtils]: 33: Hoare triple {44#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-08 05:46:57,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:46:57,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:46:57,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:46:57,664 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-08 05:46:57,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-08 05:46:57,665 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {44#false} is VALID [2022-04-08 05:46:57,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-08 05:46:57,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-08 05:46:57,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-08 05:46:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 05:46:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:57,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119504672] [2022-04-08 05:46:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119504672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:57,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:57,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:46:57,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321597832] [2022-04-08 05:46:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321597832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:46:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735711984] [2022-04-08 05:46:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 05:46:57,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:57,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:57,718 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:46:57,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:46:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:46:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:46:57,743 INFO L87 Difference]: Start difference. First operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:57,923 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-08 05:46:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:46:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 05:46:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-08 05:46:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-08 05:46:57,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-04-08 05:46:58,057 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:46:58,065 INFO L225 Difference]: With dead ends: 73 [2022-04-08 05:46:58,066 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 05:46:58,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:46:58,072 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:58,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:46:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 05:46:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 05:46:58,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:58,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:58,102 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:58,103 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:58,111 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 05:46:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 05:46:58,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:58,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:58,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-08 05:46:58,113 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-08 05:46:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:58,130 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 05:46:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 05:46:58,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:58,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:58,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:58,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-08 05:46:58,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-08 05:46:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:58,136 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-08 05:46:58,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:58,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-08 05:46:58,184 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:46:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 05:46:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 05:46:58,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:58,191 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:46:58,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:46:58,192 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 1 times [2022-04-08 05:46:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [869356417] [2022-04-08 05:46:58,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 2 times [2022-04-08 05:46:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067618921] [2022-04-08 05:46:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:58,236 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:58,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900164230] [2022-04-08 05:46:58,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:58,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:58,239 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:46:58,272 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:46:58,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:58,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:58,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:46:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:58,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:58,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-08 05:46:58,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 05:46:58,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-08 05:46:58,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-08 05:46:58,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-08 05:46:58,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-08 05:46:58,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-08 05:46:58,576 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,576 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-08 05:46:58,577 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,577 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-08 05:46:58,577 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:46:58,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:58,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:58,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-08 05:46:58,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,584 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,590 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,590 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,600 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-08 05:46:58,601 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-08 05:46:58,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-08 05:46:58,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-08 05:46:58,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-08 05:46:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 05:46:58,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:58,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-08 05:46:58,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-08 05:46:58,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-08 05:46:58,879 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-08 05:46:58,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-08 05:46:58,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,890 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,890 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,891 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,891 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-08 05:46:58,892 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-08 05:46:58,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:58,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:58,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:46:58,894 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,894 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-08 05:46:58,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,894 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,894 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-08 05:46:58,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-08 05:46:58,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-08 05:46:58,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-08 05:46:58,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-08 05:46:58,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-08 05:46:58,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-08 05:46:58,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-08 05:46:58,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-08 05:46:58,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 05:46:58,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 05:46:58,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-08 05:46:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 05:46:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067618921] [2022-04-08 05:46:58,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900164230] [2022-04-08 05:46:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900164230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:58,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:58,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 05:46:58,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:58,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [869356417] [2022-04-08 05:46:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [869356417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:46:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619951112] [2022-04-08 05:46:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-08 05:46:58,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:58,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:58,922 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:46:58,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:46:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:46:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:46:58,924 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:59,213 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-08 05:46:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:46:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-08 05:46:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 05:46:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 05:46:59,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-08 05:46:59,282 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:46:59,284 INFO L225 Difference]: With dead ends: 52 [2022-04-08 05:46:59,284 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 05:46:59,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:46:59,287 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:59,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:46:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 05:46:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-08 05:46:59,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:59,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:59,313 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:59,314 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:59,321 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 05:46:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-08 05:46:59,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:59,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:59,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-08 05:46:59,322 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-08 05:46:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:59,329 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 05:46:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-08 05:46:59,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:59,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:59,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:59,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:46:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-08 05:46:59,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 44 [2022-04-08 05:46:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:59,333 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-08 05:46:59,333 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:46:59,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-08 05:46:59,374 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:46:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-08 05:46:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 05:46:59,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:59,375 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:46:59,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 05:46:59,589 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:46:59,590 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 1 times [2022-04-08 05:46:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:59,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763454595] [2022-04-08 05:46:59,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 2 times [2022-04-08 05:46:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:59,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488001996] [2022-04-08 05:46:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:59,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:59,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410407798] [2022-04-08 05:46:59,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:59,610 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:46:59,611 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:46:59,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:46:59,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:59,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 05:46:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:59,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:59,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #103#return; {901#true} is VALID [2022-04-08 05:46:59,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {901#true} is VALID [2022-04-08 05:46:59,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {901#true} {901#true} #79#return; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L272 TraceCheckUtils]: 12: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {901#true} {901#true} #81#return; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L272 TraceCheckUtils]: 17: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {901#true} {901#true} #83#return; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L272 TraceCheckUtils]: 22: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {901#true} {901#true} #85#return; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {901#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L272 TraceCheckUtils]: 28: Hoare triple {901#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,766 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {901#true} {901#true} #87#return; {901#true} is VALID [2022-04-08 05:46:59,767 INFO L272 TraceCheckUtils]: 33: Hoare triple {901#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-08 05:46:59,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-08 05:46:59,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-08 05:46:59,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-08 05:46:59,767 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {901#true} {901#true} #89#return; {901#true} is VALID [2022-04-08 05:46:59,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {901#true} assume !false; {901#true} is VALID [2022-04-08 05:46:59,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:46:59,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !false; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:46:59,768 INFO L272 TraceCheckUtils]: 41: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:59,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:59,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {1034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {902#false} is VALID [2022-04-08 05:46:59,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-08 05:46:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 05:46:59,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:46:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488001996] [2022-04-08 05:46:59,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410407798] [2022-04-08 05:46:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410407798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:59,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:59,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:46:59,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763454595] [2022-04-08 05:46:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763454595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:59,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:59,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:46:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23462049] [2022-04-08 05:46:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-08 05:46:59,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:59,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 05:46:59,790 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:46:59,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:46:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:59,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:46:59,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:46:59,791 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 05:46:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:59,963 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 05:46:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:46:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-08 05:46:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 05:46:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 05:46:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 05:46:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 05:46:59,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 05:47:00,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:00,014 INFO L225 Difference]: With dead ends: 50 [2022-04-08 05:47:00,015 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 05:47:00,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:47:00,015 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:00,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:47:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 05:47:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-04-08 05:47:00,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:00,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:47:00,039 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:47:00,039 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:47:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:00,057 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-08 05:47:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-08 05:47:00,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:00,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:00,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-08 05:47:00,058 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-08 05:47:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:00,059 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-08 05:47:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-08 05:47:00,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:00,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:00,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:00,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:47:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-04-08 05:47:00,061 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 45 [2022-04-08 05:47:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:00,062 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-04-08 05:47:00,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 05:47:00,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 54 transitions. [2022-04-08 05:47:00,112 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:47:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 05:47:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 05:47:00,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:00,114 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:00,133 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:47:00,315 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:47:00,315 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 1 times [2022-04-08 05:47:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922448565] [2022-04-08 05:47:00,316 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 2 times [2022-04-08 05:47:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412291247] [2022-04-08 05:47:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:00,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814337171] [2022-04-08 05:47:00,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:00,336 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:47:00,337 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:47:00,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:00,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:00,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:47:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:00,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:00,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1324#true} {1324#true} #103#return; {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {1324#true} call #t~ret6 := main(); {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1324#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1324#true} {1324#true} #79#return; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1324#true} {1324#true} #81#return; {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L272 TraceCheckUtils]: 17: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1324#true} {1324#true} #83#return; {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L272 TraceCheckUtils]: 22: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,535 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1324#true} {1324#true} #85#return; {1324#true} is VALID [2022-04-08 05:47:00,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,537 INFO L272 TraceCheckUtils]: 28: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,538 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,538 INFO L272 TraceCheckUtils]: 33: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,538 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,544 INFO L272 TraceCheckUtils]: 41: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1324#true} is VALID [2022-04-08 05:47:00,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-08 05:47:00,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-08 05:47:00,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-08 05:47:00,545 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:47:00,545 INFO L272 TraceCheckUtils]: 46: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:00,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1472#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:00,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {1472#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1325#false} is VALID [2022-04-08 05:47:00,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-08 05:47:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 05:47:00,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:47:00,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:47:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412291247] [2022-04-08 05:47:00,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:47:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814337171] [2022-04-08 05:47:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814337171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:00,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:47:00,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:47:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922448565] [2022-04-08 05:47:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922448565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:00,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:47:00,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281271855] [2022-04-08 05:47:00,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:47:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-08 05:47:00,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:47:00,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:47:00,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:00,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:47:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:47:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:47:00,578 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:47:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:00,751 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-08 05:47:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:47:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-08 05:47:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:47:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:47:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:47:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:47:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:47:00,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:47:00,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:00,802 INFO L225 Difference]: With dead ends: 58 [2022-04-08 05:47:00,802 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 05:47:00,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:47:00,803 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:00,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:47:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 05:47:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-08 05:47:00,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:00,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:00,831 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:00,831 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:00,833 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-08 05:47:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-08 05:47:00,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:00,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:00,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-08 05:47:00,834 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-08 05:47:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:00,836 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-08 05:47:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-08 05:47:00,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:00,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:00,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:00,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-04-08 05:47:00,838 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 50 [2022-04-08 05:47:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:00,839 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-04-08 05:47:00,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:47:00,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 71 transitions. [2022-04-08 05:47:00,908 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:47:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-04-08 05:47:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 05:47:00,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:00,909 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:00,930 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:47:01,119 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:47:01,120 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 1 times [2022-04-08 05:47:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520342847] [2022-04-08 05:47:01,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 2 times [2022-04-08 05:47:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:01,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008067121] [2022-04-08 05:47:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:01,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:01,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835169067] [2022-04-08 05:47:01,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:01,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:01,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:01,149 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:47:01,150 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:47:01,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:01,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:47:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:01,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:01,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-08 05:47:01,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1818#true} is VALID [2022-04-08 05:47:01,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #103#return; {1818#true} is VALID [2022-04-08 05:47:01,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret6 := main(); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1818#true} {1818#true} #79#return; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L272 TraceCheckUtils]: 12: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1818#true} {1818#true} #81#return; {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1818#true} #83#return; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L272 TraceCheckUtils]: 22: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1818#true} {1818#true} #85#return; {1818#true} is VALID [2022-04-08 05:47:01,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,371 INFO L272 TraceCheckUtils]: 28: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,371 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,371 INFO L272 TraceCheckUtils]: 33: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,372 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,373 INFO L272 TraceCheckUtils]: 41: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,374 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #91#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,374 INFO L272 TraceCheckUtils]: 46: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1818#true} is VALID [2022-04-08 05:47:01,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-08 05:47:01,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-08 05:47:01,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-08 05:47:01,375 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #93#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:47:01,376 INFO L272 TraceCheckUtils]: 51: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:01,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:01,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {1981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1819#false} is VALID [2022-04-08 05:47:01,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-08 05:47:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 05:47:01,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:47:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:47:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008067121] [2022-04-08 05:47:01,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:47:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835169067] [2022-04-08 05:47:01,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835169067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:01,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:01,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:47:01,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:47:01,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520342847] [2022-04-08 05:47:01,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520342847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:01,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:01,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:47:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128126456] [2022-04-08 05:47:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:47:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-08 05:47:01,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:47:01,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-08 05:47:01,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:01,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:47:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:47:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:47:01,401 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-08 05:47:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:01,588 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2022-04-08 05:47:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:47:01,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-08 05:47:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:47:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-08 05:47:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:47:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-08 05:47:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:47:01,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:47:01,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:01,641 INFO L225 Difference]: With dead ends: 62 [2022-04-08 05:47:01,641 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 05:47:01,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:47:01,642 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:01,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:47:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 05:47:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-08 05:47:01,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:01,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:01,674 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:01,674 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:01,676 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-08 05:47:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-08 05:47:01,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:01,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:01,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-08 05:47:01,677 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-08 05:47:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:01,705 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-08 05:47:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-08 05:47:01,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:01,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:01,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:01,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-04-08 05:47:01,707 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 55 [2022-04-08 05:47:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:01,707 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-04-08 05:47:01,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-08 05:47:01,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 74 transitions. [2022-04-08 05:47:01,777 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:47:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-04-08 05:47:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 05:47:01,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:01,777 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:01,799 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:47:01,991 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:47:01,991 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 1 times [2022-04-08 05:47:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870559938] [2022-04-08 05:47:01,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 2 times [2022-04-08 05:47:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:01,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342448876] [2022-04-08 05:47:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:02,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705655074] [2022-04-08 05:47:02,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:02,010 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:47:02,011 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:47:02,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:02,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 05:47:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:02,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:02,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2022-04-08 05:47:02,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-08 05:47:02,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #103#return; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret6 := main(); {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2351#true} {2351#true} #79#return; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L272 TraceCheckUtils]: 12: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2351#true} {2351#true} #81#return; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L272 TraceCheckUtils]: 17: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2351#true} {2351#true} #83#return; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L272 TraceCheckUtils]: 22: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,352 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2351#true} {2351#true} #85#return; {2351#true} is VALID [2022-04-08 05:47:02,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,354 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #87#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,354 INFO L272 TraceCheckUtils]: 33: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,355 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #89#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,356 INFO L272 TraceCheckUtils]: 41: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-08 05:47:02,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-08 05:47:02,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-08 05:47:02,357 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #91#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,357 INFO L272 TraceCheckUtils]: 46: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:02,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:02,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:02,358 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #93#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,358 INFO L272 TraceCheckUtils]: 51: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2351#true} is VALID [2022-04-08 05:47:02,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:02,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:02,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:02,360 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #95#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:47:02,360 INFO L272 TraceCheckUtils]: 56: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:02,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:02,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {2531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2352#false} is VALID [2022-04-08 05:47:02,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-08 05:47:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 05:47:02,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:47:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:47:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342448876] [2022-04-08 05:47:53,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:47:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705655074] [2022-04-08 05:47:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705655074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:47:53,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:47:53,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 05:47:53,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:47:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870559938] [2022-04-08 05:47:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870559938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:53,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:53,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:47:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635585822] [2022-04-08 05:47:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:47:53,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-08 05:47:53,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:47:53,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-08 05:47:53,340 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:47:53,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:47:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:53,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:47:53,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:47:53,341 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-08 05:47:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:53,762 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-08 05:47:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:47:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-08 05:47:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:47:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-08 05:47:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 05:47:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-08 05:47:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 05:47:53,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-08 05:47:53,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:53,818 INFO L225 Difference]: With dead ends: 66 [2022-04-08 05:47:53,818 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 05:47:53,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:47:53,819 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:53,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:47:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 05:47:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-08 05:47:53,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:53,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:53,868 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:53,868 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:53,871 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-08 05:47:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-08 05:47:53,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:53,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:53,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 05:47:53,872 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 05:47:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:53,874 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-08 05:47:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-08 05:47:53,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:53,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:53,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:53,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 05:47:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-08 05:47:53,879 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2022-04-08 05:47:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:53,879 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-04-08 05:47:53,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-08 05:47:53,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-08 05:47:53,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-08 05:47:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 05:47:53,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:53,981 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:53,999 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:47:54,182 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:47:54,182 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 1 times [2022-04-08 05:47:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:54,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751203565] [2022-04-08 05:47:54,183 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 2 times [2022-04-08 05:47:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:54,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492638805] [2022-04-08 05:47:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:54,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:54,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534758427] [2022-04-08 05:47:54,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:54,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:54,206 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:47:54,236 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:47:54,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:54,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:54,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 05:47:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:54,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:54,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-08 05:47:54,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-08 05:47:54,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-08 05:47:54,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-08 05:47:54,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-08 05:47:54,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,484 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-08 05:47:54,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-08 05:47:54,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,487 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-08 05:47:54,487 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,488 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,492 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-08 05:47:54,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-08 05:47:54,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,493 INFO L272 TraceCheckUtils]: 41: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,494 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #91#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,494 INFO L272 TraceCheckUtils]: 46: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,495 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #93#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,495 INFO L272 TraceCheckUtils]: 51: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,496 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #95#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,496 INFO L272 TraceCheckUtils]: 56: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,497 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #97#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:47:54,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 05:47:54,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} assume !false; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-08 05:47:54,500 INFO L272 TraceCheckUtils]: 63: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:54,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:54,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-08 05:47:54,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-08 05:47:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 05:47:54,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:47:54,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-08 05:47:54,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-08 05:47:54,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:54,769 INFO L272 TraceCheckUtils]: 63: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:54,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,772 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #97#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,772 INFO L272 TraceCheckUtils]: 56: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,773 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #95#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,773 INFO L272 TraceCheckUtils]: 51: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,774 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #93#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,774 INFO L272 TraceCheckUtils]: 46: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,777 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #91#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,778 INFO L272 TraceCheckUtils]: 41: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:47:54,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-08 05:47:54,779 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-08 05:47:54,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-08 05:47:54,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-08 05:47:54,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-08 05:47:54,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-08 05:47:54,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-08 05:47:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 05:47:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:47:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492638805] [2022-04-08 05:47:54,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:47:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534758427] [2022-04-08 05:47:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534758427] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:47:54,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:47:54,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 05:47:54,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:47:54,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751203565] [2022-04-08 05:47:54,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751203565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:54,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:54,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:47:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578028475] [2022-04-08 05:47:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:47:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-08 05:47:54,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:47:54,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-08 05:47:54,813 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:47:54,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:47:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:47:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:47:54,814 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-08 05:47:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:54,992 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 05:47:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:47:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-08 05:47:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:47:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-08 05:47:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 05:47:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-08 05:47:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 05:47:54,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 05:47:55,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:55,033 INFO L225 Difference]: With dead ends: 69 [2022-04-08 05:47:55,033 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 05:47:55,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:47:55,034 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:55,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:47:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 05:47:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-04-08 05:47:55,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:55,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:47:55,068 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:47:55,068 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:47:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:55,070 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-08 05:47:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-08 05:47:55,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:55,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:55,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 05:47:55,071 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 05:47:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:55,074 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-08 05:47:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-08 05:47:55,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:55,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:55,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:55,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:47:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-04-08 05:47:55,076 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 67 [2022-04-08 05:47:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:55,077 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-04-08 05:47:55,077 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-08 05:47:55,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 71 transitions. [2022-04-08 05:47:55,159 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:47:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-04-08 05:47:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 05:47:55,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:55,160 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:55,181 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:47:55,360 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:47:55,360 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 1 times [2022-04-08 05:47:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:55,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274455944] [2022-04-08 05:47:55,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 2 times [2022-04-08 05:47:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:55,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541567536] [2022-04-08 05:47:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:55,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:55,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447843482] [2022-04-08 05:47:55,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:55,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:55,384 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:47:55,385 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:47:55,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:55,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:55,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:47:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:55,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:55,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-08 05:47:55,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-08 05:47:55,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-08 05:47:55,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-08 05:47:55,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:47:55,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:47:55,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:47:55,630 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-08 05:47:55,630 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,630 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,631 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,631 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,632 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,633 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,633 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,634 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,634 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,635 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,635 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,635 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,636 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-08 05:47:55,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-08 05:47:55,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-08 05:47:55,637 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-08 05:47:55,637 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-08 05:47:55,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-08 05:47:55,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-08 05:47:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 05:47:55,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:47:55,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-08 05:47:55,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-08 05:47:55,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-08 05:47:55,906 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-08 05:47:55,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-08 05:47:55,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-08 05:47:55,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-08 05:47:55,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,908 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,908 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,908 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,909 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,909 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,910 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,911 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,911 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:47:55,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,912 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,913 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,913 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,913 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-08 05:47:55,914 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-08 05:47:55,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,915 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,915 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-08 05:47:55,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:47:55,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:47:55,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:47:55,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,916 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-08 05:47:55,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-08 05:47:55,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-08 05:47:55,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-08 05:47:55,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-08 05:47:55,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-08 05:47:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 05:47:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:47:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541567536] [2022-04-08 05:47:55,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:47:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447843482] [2022-04-08 05:47:55,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447843482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:47:55,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:47:55,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:47:55,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:47:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274455944] [2022-04-08 05:47:55,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274455944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:47:55,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:47:55,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:47:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694283725] [2022-04-08 05:47:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:47:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-08 05:47:55,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:47:55,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:47:55,951 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:47:55,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:47:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:55,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:47:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:47:55,952 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:47:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:56,677 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-08 05:47:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:47:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-08 05:47:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:47:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:47:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-08 05:47:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:47:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-08 05:47:56,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-04-08 05:47:56,760 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:47:56,761 INFO L225 Difference]: With dead ends: 106 [2022-04-08 05:47:56,762 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 05:47:56,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:47:56,762 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:47:56,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:47:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 05:47:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-08 05:47:56,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:47:56,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 05:47:56,888 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 05:47:56,894 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 05:47:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:56,898 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-08 05:47:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-08 05:47:56,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:56,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:56,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-08 05:47:56,901 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-08 05:47:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:47:56,905 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-08 05:47:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-08 05:47:56,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:47:56,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:47:56,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:47:56,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:47:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 05:47:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2022-04-08 05:47:56,909 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 69 [2022-04-08 05:47:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:47:56,910 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2022-04-08 05:47:56,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:47:56,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 122 transitions. [2022-04-08 05:47:57,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:47:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2022-04-08 05:47:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 05:47:57,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:47:57,065 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:47:57,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 05:47:57,271 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:47:57,271 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:47:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:47:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 1 times [2022-04-08 05:47:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:47:57,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084420890] [2022-04-08 05:47:57,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:47:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 2 times [2022-04-08 05:47:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:47:57,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160210140] [2022-04-08 05:47:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:47:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:47:57,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:47:57,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301533484] [2022-04-08 05:47:57,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:47:57,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:47:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:47:57,290 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:47:57,291 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:47:57,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:47:57,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:47:57,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 05:47:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:47:57,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:47:57,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,597 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-08 05:47:57,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:47:57,598 INFO L272 TraceCheckUtils]: 28: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,599 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #87#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:47:57,599 INFO L272 TraceCheckUtils]: 33: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,600 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #89#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:47:57,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:47:57,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4885#(= main_~q~0 0)} is VALID [2022-04-08 05:47:57,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {4885#(= main_~q~0 0)} assume !false; {4885#(= main_~q~0 0)} is VALID [2022-04-08 05:47:57,601 INFO L272 TraceCheckUtils]: 41: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,601 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #91#return; {4885#(= main_~q~0 0)} is VALID [2022-04-08 05:47:57,601 INFO L272 TraceCheckUtils]: 46: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,602 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #93#return; {4885#(= main_~q~0 0)} is VALID [2022-04-08 05:47:57,602 INFO L272 TraceCheckUtils]: 51: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:57,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:57,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:47:57,604 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4885#(= main_~q~0 0)} #95#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:47:57,604 INFO L272 TraceCheckUtils]: 56: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,605 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #97#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:47:57,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:47:57,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:47:57,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:47:57,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:47:57,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:47:57,607 INFO L272 TraceCheckUtils]: 66: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:47:57,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:47:57,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:47:57,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:47:57,608 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:47:57,609 INFO L272 TraceCheckUtils]: 71: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:47:57,609 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:47:57,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-08 05:47:57,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-08 05:47:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 05:47:57,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:48:06,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-08 05:48:06,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-08 05:48:06,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:06,767 INFO L272 TraceCheckUtils]: 71: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:48:06,768 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:48:06,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,768 INFO L272 TraceCheckUtils]: 66: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:48:06,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:48:06,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:48:06,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:48:06,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:48:06,775 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:48:06,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,775 INFO L272 TraceCheckUtils]: 56: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,776 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4762#true} #95#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:48:06,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:06,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:48:06,777 INFO L272 TraceCheckUtils]: 51: Hoare triple {4762#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4762#true} #93#return; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L272 TraceCheckUtils]: 46: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4762#true} #91#return; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L272 TraceCheckUtils]: 41: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {4762#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4762#true} is VALID [2022-04-08 05:48:06,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4762#true} #89#return; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L272 TraceCheckUtils]: 33: Hoare triple {4762#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4762#true} #87#return; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L272 TraceCheckUtils]: 28: Hoare triple {4762#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,778 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-08 05:48:06,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-08 05:48:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 05:48:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:48:06,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160210140] [2022-04-08 05:48:06,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:48:06,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301533484] [2022-04-08 05:48:06,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301533484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:48:06,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:48:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 05:48:06,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:48:06,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084420890] [2022-04-08 05:48:06,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084420890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:48:06,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:48:06,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:48:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564828562] [2022-04-08 05:48:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:48:06,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-08 05:48:06,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:48:06,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:48:06,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:48:06,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:48:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:48:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:48:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 05:48:06,820 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:48:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:07,636 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-04-08 05:48:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:48:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-08 05:48:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:48:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:48:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-08 05:48:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:48:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-08 05:48:07,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-08 05:48:07,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:48:07,718 INFO L225 Difference]: With dead ends: 124 [2022-04-08 05:48:07,718 INFO L226 Difference]: Without dead ends: 121 [2022-04-08 05:48:07,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-08 05:48:07,718 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:48:07,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 218 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:48:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-08 05:48:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-04-08 05:48:07,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:48:07,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:07,884 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:07,884 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:07,888 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-08 05:48:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-08 05:48:07,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:07,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:07,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-08 05:48:07,889 INFO L87 Difference]: Start difference. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-08 05:48:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:07,892 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-08 05:48:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-08 05:48:07,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:07,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:07,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:48:07,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:48:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-04-08 05:48:07,895 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 75 [2022-04-08 05:48:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:48:07,895 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-04-08 05:48:07,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:48:07,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 166 transitions. [2022-04-08 05:48:08,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:48:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-04-08 05:48:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 05:48:08,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:48:08,121 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:48:08,155 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:48:08,321 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:48:08,321 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:48:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:48:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 3 times [2022-04-08 05:48:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:48:08,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222059180] [2022-04-08 05:48:08,322 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:48:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 4 times [2022-04-08 05:48:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:48:08,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638730397] [2022-04-08 05:48:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:48:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:48:08,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:48:08,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706787596] [2022-04-08 05:48:08,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:48:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:48:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:48:08,337 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:48:08,338 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:48:08,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:48:08,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:48:08,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 05:48:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:48:08,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:48:09,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-08 05:48:09,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-08 05:48:09,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:48:09,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:48:09,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:48:09,576 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {5956#true} #81#return; {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,576 INFO L272 TraceCheckUtils]: 17: Hoare triple {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:48:09,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:48:09,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:48:09,577 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #83#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,578 INFO L272 TraceCheckUtils]: 22: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} #85#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,584 INFO L272 TraceCheckUtils]: 28: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,585 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #87#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,585 INFO L272 TraceCheckUtils]: 33: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,585 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #89#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !false; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,591 INFO L272 TraceCheckUtils]: 41: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,600 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,600 INFO L272 TraceCheckUtils]: 46: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,601 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,601 INFO L272 TraceCheckUtils]: 51: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:09,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:09,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:09,603 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,603 INFO L272 TraceCheckUtils]: 56: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,604 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:48:09,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,606 INFO L272 TraceCheckUtils]: 66: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:09,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:09,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:09,607 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} #91#return; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,607 INFO L272 TraceCheckUtils]: 71: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:09,608 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:09,608 INFO L290 TraceCheckUtils]: 73: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:09,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:09,610 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} #93#return; {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-08 05:48:09,611 INFO L272 TraceCheckUtils]: 76: Hoare triple {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:48:09,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:09,611 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-08 05:48:09,611 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-08 05:48:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 05:48:09,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:48:47,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-08 05:48:47,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-08 05:48:47,717 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:47,717 INFO L272 TraceCheckUtils]: 76: Hoare triple {6221#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:48:47,718 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #93#return; {6221#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:48:47,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:47,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:47,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:48:47,719 INFO L272 TraceCheckUtils]: 71: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,719 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #91#return; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:48:47,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,719 INFO L272 TraceCheckUtils]: 66: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:48:47,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:48:47,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:48:47,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:48:47,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !(~c~0 >= ~b~0); {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,771 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #97#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,771 INFO L272 TraceCheckUtils]: 56: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,772 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #95#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,772 INFO L272 TraceCheckUtils]: 51: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,773 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #93#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,773 INFO L272 TraceCheckUtils]: 46: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,774 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #91#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,774 INFO L272 TraceCheckUtils]: 41: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !false; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-08 05:48:47,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !false; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:48:47,776 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #89#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:48:47,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,776 INFO L272 TraceCheckUtils]: 33: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,777 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #87#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:48:47,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,777 INFO L272 TraceCheckUtils]: 28: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {5956#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:48:47,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {5956#true} #85#return; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5956#true} {5956#true} #83#return; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5956#true} {5956#true} #81#return; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-08 05:48:47,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-08 05:48:47,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-08 05:48:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 05:48:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:48:47,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638730397] [2022-04-08 05:48:47,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:48:47,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706787596] [2022-04-08 05:48:47,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706787596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:48:47,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:48:47,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-08 05:48:47,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:48:47,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1222059180] [2022-04-08 05:48:47,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1222059180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:48:47,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:48:47,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 05:48:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156667873] [2022-04-08 05:48:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:48:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-08 05:48:47,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:48:47,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-08 05:48:47,829 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:48:47,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 05:48:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:48:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 05:48:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:48:47,830 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-08 05:48:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:49,494 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2022-04-08 05:48:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:48:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-08 05:48:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:48:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-08 05:48:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-08 05:48:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-08 05:48:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-08 05:48:49,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 91 transitions. [2022-04-08 05:48:49,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:48:49,584 INFO L225 Difference]: With dead ends: 134 [2022-04-08 05:48:49,584 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 05:48:49,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2022-04-08 05:48:49,584 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 05:48:49,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 157 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 05:48:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 05:48:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-04-08 05:48:49,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:48:49,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:49,806 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:49,806 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:49,809 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-08 05:48:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-08 05:48:49,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:49,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:49,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-08 05:48:49,810 INFO L87 Difference]: Start difference. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-08 05:48:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:49,813 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-08 05:48:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-08 05:48:49,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:49,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:49,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:48:49,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:48:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:48:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 175 transitions. [2022-04-08 05:48:49,816 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 175 transitions. Word has length 80 [2022-04-08 05:48:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:48:49,817 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 175 transitions. [2022-04-08 05:48:49,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-08 05:48:49,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 175 transitions. [2022-04-08 05:48:50,059 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:48:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2022-04-08 05:48:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 05:48:50,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:48:50,060 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:48:50,082 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:48:50,266 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:48:50,266 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:48:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:48:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 5 times [2022-04-08 05:48:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:48:50,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533951731] [2022-04-08 05:48:50,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:48:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 6 times [2022-04-08 05:48:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:48:50,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277255159] [2022-04-08 05:48:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:48:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:48:50,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:48:50,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30408235] [2022-04-08 05:48:50,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:48:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:48:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:48:50,287 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:48:50,288 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:48:50,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:48:50,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:48:50,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 05:48:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:48:50,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:48:50,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {7262#true} call ULTIMATE.init(); {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {7262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7262#true} {7262#true} #103#return; {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {7262#true} call #t~ret6 := main(); {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {7262#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7262#true} {7262#true} #79#return; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {7262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7262#true} {7262#true} #81#return; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L272 TraceCheckUtils]: 17: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7262#true} {7262#true} #83#return; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L272 TraceCheckUtils]: 22: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,884 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7262#true} {7262#true} #85#return; {7262#true} is VALID [2022-04-08 05:48:50,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {7262#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:48:50,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,886 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #87#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:48:50,886 INFO L272 TraceCheckUtils]: 33: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,886 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #89#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:48:50,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:48:50,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !false; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,888 INFO L272 TraceCheckUtils]: 41: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,900 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #91#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,901 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #93#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,901 INFO L272 TraceCheckUtils]: 51: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #95#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,902 INFO L272 TraceCheckUtils]: 56: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,903 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #97#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:48:50,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,905 INFO L272 TraceCheckUtils]: 66: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,906 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {7262#true} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,906 INFO L272 TraceCheckUtils]: 71: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-08 05:48:50,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-08 05:48:50,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-08 05:48:50,907 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7262#true} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,907 INFO L272 TraceCheckUtils]: 76: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-08 05:48:50,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {7262#true} ~cond := #in~cond; {7501#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:50,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {7501#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:50,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:48:50,909 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {7512#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:48:50,911 INFO L272 TraceCheckUtils]: 81: Hoare triple {7512#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:48:50,912 INFO L290 TraceCheckUtils]: 82: Hoare triple {7516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:48:50,912 INFO L290 TraceCheckUtils]: 83: Hoare triple {7520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7263#false} is VALID [2022-04-08 05:48:50,912 INFO L290 TraceCheckUtils]: 84: Hoare triple {7263#false} assume !false; {7263#false} is VALID [2022-04-08 05:48:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-08 05:48:50,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:27,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277255159] [2022-04-08 05:49:27,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:27,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30408235] [2022-04-08 05:49:27,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30408235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:49:27,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:49:27,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 05:49:27,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:27,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533951731] [2022-04-08 05:49:27,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533951731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:27,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:27,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:49:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751754706] [2022-04-08 05:49:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-08 05:49:27,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:27,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-08 05:49:27,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:27,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:49:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:49:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:49:27,895 INFO L87 Difference]: Start difference. First operand 130 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-08 05:49:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:29,042 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2022-04-08 05:49:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 05:49:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-08 05:49:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-08 05:49:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-08 05:49:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-08 05:49:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-08 05:49:29,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 98 transitions. [2022-04-08 05:49:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:29,146 INFO L225 Difference]: With dead ends: 142 [2022-04-08 05:49:29,146 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 05:49:29,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-08 05:49:29,147 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:29,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 222 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:49:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 05:49:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-04-08 05:49:29,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:29,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:49:29,385 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:49:29,386 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:49:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:29,388 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2022-04-08 05:49:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2022-04-08 05:49:29,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:29,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:29,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 140 states. [2022-04-08 05:49:29,389 INFO L87 Difference]: Start difference. First operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 140 states. [2022-04-08 05:49:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:29,395 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2022-04-08 05:49:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2022-04-08 05:49:29,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:29,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:29,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:29,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:49:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2022-04-08 05:49:29,398 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 85 [2022-04-08 05:49:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:29,399 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2022-04-08 05:49:29,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-08 05:49:29,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 181 transitions. [2022-04-08 05:49:29,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2022-04-08 05:49:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 05:49:29,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:29,656 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:49:29,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:29,859 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:49:29,861 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 1 times [2022-04-08 05:49:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882822504] [2022-04-08 05:49:29,862 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 2 times [2022-04-08 05:49:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892458791] [2022-04-08 05:49:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:29,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:29,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627827595] [2022-04-08 05:49:29,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:49:29,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:29,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:29,885 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:49:29,885 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:49:29,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:49:29,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:29,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 05:49:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:29,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:30,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {8389#true} call ULTIMATE.init(); {8389#true} is VALID [2022-04-08 05:49:30,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8389#true} is VALID [2022-04-08 05:49:30,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8389#true} {8389#true} #103#return; {8389#true} is VALID [2022-04-08 05:49:30,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {8389#true} call #t~ret6 := main(); {8389#true} is VALID [2022-04-08 05:49:30,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {8389#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8389#true} {8389#true} #79#return; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {8389#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L272 TraceCheckUtils]: 12: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8389#true} {8389#true} #81#return; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L272 TraceCheckUtils]: 17: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8389#true} {8389#true} #83#return; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,507 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8389#true} {8389#true} #85#return; {8389#true} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {8389#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,511 INFO L272 TraceCheckUtils]: 28: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,512 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8389#true} {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,512 INFO L272 TraceCheckUtils]: 33: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,513 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8389#true} {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,514 INFO L272 TraceCheckUtils]: 41: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,515 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,515 INFO L272 TraceCheckUtils]: 46: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,516 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,516 INFO L272 TraceCheckUtils]: 51: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,516 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,516 INFO L272 TraceCheckUtils]: 56: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,517 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,518 INFO L272 TraceCheckUtils]: 63: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,519 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #91#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,519 INFO L272 TraceCheckUtils]: 68: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,520 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #93#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,520 INFO L272 TraceCheckUtils]: 73: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,521 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,521 INFO L272 TraceCheckUtils]: 78: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:30,522 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:30,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:49:30,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:49:30,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {8656#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:49:30,524 INFO L272 TraceCheckUtils]: 87: Hoare triple {8656#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 89: Hoare triple {8664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8390#false} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {8390#false} assume !false; {8390#false} is VALID [2022-04-08 05:49:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-08 05:49:30,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:30,973 INFO L290 TraceCheckUtils]: 90: Hoare triple {8390#false} assume !false; {8390#false} is VALID [2022-04-08 05:49:30,973 INFO L290 TraceCheckUtils]: 89: Hoare triple {8664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8390#false} is VALID [2022-04-08 05:49:30,973 INFO L290 TraceCheckUtils]: 88: Hoare triple {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:30,974 INFO L272 TraceCheckUtils]: 87: Hoare triple {8680#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:30,974 INFO L290 TraceCheckUtils]: 86: Hoare triple {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {8680#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-08 05:49:30,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:49:32,976 WARN L290 TraceCheckUtils]: 84: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-08 05:49:32,976 INFO L290 TraceCheckUtils]: 83: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:32,977 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:32,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:32,977 INFO L290 TraceCheckUtils]: 80: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:32,977 INFO L290 TraceCheckUtils]: 79: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:32,977 INFO L272 TraceCheckUtils]: 78: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:32,978 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:32,978 INFO L290 TraceCheckUtils]: 76: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:32,978 INFO L290 TraceCheckUtils]: 75: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:32,978 INFO L290 TraceCheckUtils]: 74: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:32,978 INFO L272 TraceCheckUtils]: 73: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:32,979 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:32,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:32,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:32,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:32,979 INFO L272 TraceCheckUtils]: 68: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:32,980 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:32,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:32,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:32,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:32,980 INFO L272 TraceCheckUtils]: 63: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:32,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:33,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:49:33,482 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #97#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,482 INFO L272 TraceCheckUtils]: 56: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,482 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #95#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L272 TraceCheckUtils]: 51: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #93#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,484 INFO L272 TraceCheckUtils]: 46: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,484 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #91#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,484 INFO L272 TraceCheckUtils]: 41: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,486 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8389#true} {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #89#return; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,486 INFO L272 TraceCheckUtils]: 33: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,487 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8389#true} {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #87#return; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,487 INFO L272 TraceCheckUtils]: 28: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {8389#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:49:33,488 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8389#true} {8389#true} #85#return; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L272 TraceCheckUtils]: 22: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8389#true} {8389#true} #83#return; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L272 TraceCheckUtils]: 17: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8389#true} {8389#true} #81#return; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,488 INFO L272 TraceCheckUtils]: 12: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {8389#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8389#true} {8389#true} #79#return; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {8389#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {8389#true} call #t~ret6 := main(); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8389#true} {8389#true} #103#return; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {8389#true} call ULTIMATE.init(); {8389#true} is VALID [2022-04-08 05:49:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-08 05:49:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892458791] [2022-04-08 05:49:33,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627827595] [2022-04-08 05:49:33,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627827595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:33,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 05:49:33,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882822504] [2022-04-08 05:49:33,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882822504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:33,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:49:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301424811] [2022-04-08 05:49:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-08 05:49:33,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:33,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-08 05:49:33,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:33,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:49:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:33,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:49:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:49:33,546 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-08 05:49:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:34,776 INFO L93 Difference]: Finished difference Result 165 states and 217 transitions. [2022-04-08 05:49:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:49:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-08 05:49:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-08 05:49:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 05:49:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-08 05:49:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-08 05:49:34,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-08 05:49:34,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:34,882 INFO L225 Difference]: With dead ends: 165 [2022-04-08 05:49:34,882 INFO L226 Difference]: Without dead ends: 162 [2022-04-08 05:49:34,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:49:34,883 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:34,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 275 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:49:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-08 05:49:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2022-04-08 05:49:35,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:35,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:35,161 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:35,162 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:35,180 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2022-04-08 05:49:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2022-04-08 05:49:35,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:35,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:35,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 162 states. [2022-04-08 05:49:35,181 INFO L87 Difference]: Start difference. First operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 162 states. [2022-04-08 05:49:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:35,184 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2022-04-08 05:49:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2022-04-08 05:49:35,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:35,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:35,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:35,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2022-04-08 05:49:35,188 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 91 [2022-04-08 05:49:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:35,188 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2022-04-08 05:49:35,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-08 05:49:35,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 212 transitions. [2022-04-08 05:49:35,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2022-04-08 05:49:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 05:49:35,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:35,496 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:49:35,514 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:49:35,712 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:49:35,712 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 7 times [2022-04-08 05:49:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:35,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046550021] [2022-04-08 05:49:35,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 8 times [2022-04-08 05:49:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:35,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131564519] [2022-04-08 05:49:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:35,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:35,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528884733] [2022-04-08 05:49:35,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:49:35,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:35,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:35,724 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:49:35,725 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:49:35,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:49:35,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:35,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:49:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:35,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:35,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {9932#true} call ULTIMATE.init(); {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {9932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9932#true} {9932#true} #103#return; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {9932#true} call #t~ret6 := main(); {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {9932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {9932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9932#true} {9932#true} #79#return; {9932#true} is VALID [2022-04-08 05:49:35,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {9932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L272 TraceCheckUtils]: 12: Hoare triple {9932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9932#true} {9932#true} #81#return; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L272 TraceCheckUtils]: 17: Hoare triple {9932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9932#true} {9932#true} #83#return; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L272 TraceCheckUtils]: 22: Hoare triple {9932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9932#true} {9932#true} #85#return; {9932#true} is VALID [2022-04-08 05:49:35,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {9932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L272 TraceCheckUtils]: 28: Hoare triple {9932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9932#true} {9932#true} #87#return; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L272 TraceCheckUtils]: 33: Hoare triple {9932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9932#true} {9932#true} #89#return; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {9932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L272 TraceCheckUtils]: 41: Hoare triple {9932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,992 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9932#true} {9932#true} #91#return; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L272 TraceCheckUtils]: 46: Hoare triple {9932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9932#true} {9932#true} #93#return; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L272 TraceCheckUtils]: 51: Hoare triple {9932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9932#true} {9932#true} #95#return; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L272 TraceCheckUtils]: 56: Hoare triple {9932#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,993 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9932#true} {9932#true} #97#return; {9932#true} is VALID [2022-04-08 05:49:35,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {9932#true} assume !(~c~0 >= ~b~0); {10120#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:49:35,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {10120#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10124#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {10124#(< main_~b~0 main_~a~0)} assume !false; {10124#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {10124#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {10131#(< main_~b~0 main_~c~0)} assume !false; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:35,995 INFO L272 TraceCheckUtils]: 66: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,996 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #91#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:35,996 INFO L272 TraceCheckUtils]: 71: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,997 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #93#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:35,997 INFO L272 TraceCheckUtils]: 76: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,997 INFO L290 TraceCheckUtils]: 79: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:35,998 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #95#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:35,998 INFO L272 TraceCheckUtils]: 81: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9932#true} is VALID [2022-04-08 05:49:35,998 INFO L290 TraceCheckUtils]: 82: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-08 05:49:35,998 INFO L290 TraceCheckUtils]: 83: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-08 05:49:35,998 INFO L290 TraceCheckUtils]: 84: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-08 05:49:36,003 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #97#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {10131#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {9933#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {9933#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L272 TraceCheckUtils]: 91: Hoare triple {9933#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 92: Hoare triple {9933#false} ~cond := #in~cond; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 93: Hoare triple {9933#false} assume !(0 == ~cond); {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 94: Hoare triple {9933#false} assume true; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9933#false} {9933#false} #91#return; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L272 TraceCheckUtils]: 96: Hoare triple {9933#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {9933#false} ~cond := #in~cond; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {9933#false} assume 0 == ~cond; {9933#false} is VALID [2022-04-08 05:49:36,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-08 05:49:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-04-08 05:49:36,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:49:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:36,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131564519] [2022-04-08 05:49:36,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:36,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528884733] [2022-04-08 05:49:36,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528884733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:36,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:36,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:49:36,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:36,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046550021] [2022-04-08 05:49:36,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046550021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:36,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:36,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:49:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83487413] [2022-04-08 05:49:36,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-08 05:49:36,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:36,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-08 05:49:36,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:36,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:49:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:49:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:49:36,057 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-08 05:49:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:36,619 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2022-04-08 05:49:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:49:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-08 05:49:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-08 05:49:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-08 05:49:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-08 05:49:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-08 05:49:36,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2022-04-08 05:49:36,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:36,700 INFO L225 Difference]: With dead ends: 209 [2022-04-08 05:49:36,700 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 05:49:36,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:49:36,701 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:36,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 163 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 05:49:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2022-04-08 05:49:37,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:37,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:37,012 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:37,015 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2022-04-08 05:49:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2022-04-08 05:49:37,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:37,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:37,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 164 states. [2022-04-08 05:49:37,016 INFO L87 Difference]: Start difference. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 164 states. [2022-04-08 05:49:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:37,024 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2022-04-08 05:49:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2022-04-08 05:49:37,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:37,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:37,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:37,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:49:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2022-04-08 05:49:37,028 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 100 [2022-04-08 05:49:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:37,028 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2022-04-08 05:49:37,029 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-08 05:49:37,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 201 transitions. [2022-04-08 05:49:37,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2022-04-08 05:49:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 05:49:37,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:37,345 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:49:37,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:37,551 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:49:37,553 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 1 times [2022-04-08 05:49:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:37,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488604173] [2022-04-08 05:49:37,554 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 2 times [2022-04-08 05:49:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:37,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767708575] [2022-04-08 05:49:37,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:37,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:37,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273645325] [2022-04-08 05:49:37,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:49:37,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:37,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:37,565 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:49:37,566 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:49:37,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:49:37,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:37,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-08 05:49:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:37,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:39,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {11296#true} call ULTIMATE.init(); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11296#true} {11296#true} #103#return; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {11296#true} call #t~ret6 := main(); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11296#true} {11296#true} #79#return; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L272 TraceCheckUtils]: 12: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11296#true} {11296#true} #81#return; {11296#true} is VALID [2022-04-08 05:49:39,185 INFO L272 TraceCheckUtils]: 17: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {11296#true} ~cond := #in~cond; {11355#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:49:39,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {11355#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11359#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:39,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {11359#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11359#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:39,186 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11359#(not (= |assume_abort_if_not_#in~cond| 0))} {11296#true} #83#return; {11366#(<= 1 main_~x~0)} is VALID [2022-04-08 05:49:39,186 INFO L272 TraceCheckUtils]: 22: Hoare triple {11366#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,187 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11296#true} {11366#(<= 1 main_~x~0)} #85#return; {11366#(<= 1 main_~x~0)} is VALID [2022-04-08 05:49:39,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {11366#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,188 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11296#true} {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,188 INFO L272 TraceCheckUtils]: 33: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,189 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11296#true} {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,191 INFO L272 TraceCheckUtils]: 41: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,192 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,192 INFO L272 TraceCheckUtils]: 46: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,193 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,193 INFO L272 TraceCheckUtils]: 51: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,193 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,194 INFO L272 TraceCheckUtils]: 56: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,194 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,196 INFO L272 TraceCheckUtils]: 63: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,197 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11296#true} {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,197 INFO L272 TraceCheckUtils]: 68: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:39,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,199 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,199 INFO L272 TraceCheckUtils]: 73: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:39,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,201 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #95#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,201 INFO L272 TraceCheckUtils]: 78: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:39,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,202 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #97#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11559#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:49:39,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {11559#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,205 INFO L290 TraceCheckUtils]: 86: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,205 INFO L272 TraceCheckUtils]: 88: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,206 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11296#true} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #91#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,206 INFO L272 TraceCheckUtils]: 93: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,206 INFO L290 TraceCheckUtils]: 94: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:49:39,206 INFO L290 TraceCheckUtils]: 95: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:49:39,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:49:39,207 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11296#true} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #93#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,207 INFO L272 TraceCheckUtils]: 98: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:49:39,207 INFO L290 TraceCheckUtils]: 99: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:39,207 INFO L290 TraceCheckUtils]: 100: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,208 INFO L290 TraceCheckUtils]: 101: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:39,208 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #95#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:49:39,210 INFO L272 TraceCheckUtils]: 103: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:39,210 INFO L290 TraceCheckUtils]: 104: Hoare triple {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:39,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {11625#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11297#false} is VALID [2022-04-08 05:49:39,211 INFO L290 TraceCheckUtils]: 106: Hoare triple {11297#false} assume !false; {11297#false} is VALID [2022-04-08 05:49:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 90 proven. 49 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-08 05:49:39,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:51:39,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {11297#false} assume !false; {11297#false} is VALID [2022-04-08 05:51:39,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {11625#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11297#false} is VALID [2022-04-08 05:51:39,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:39,263 INFO L272 TraceCheckUtils]: 103: Hoare triple {11641#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:51:39,264 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {11641#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-08 05:51:39,264 INFO L290 TraceCheckUtils]: 101: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:39,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:39,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:51:39,265 INFO L272 TraceCheckUtils]: 98: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:39,266 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11296#true} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:51:39,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:39,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:39,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:39,266 INFO L272 TraceCheckUtils]: 93: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:39,267 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11296#true} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:51:39,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:39,267 INFO L290 TraceCheckUtils]: 90: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:39,267 INFO L290 TraceCheckUtils]: 89: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:39,267 INFO L272 TraceCheckUtils]: 88: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:39,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:51:39,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:51:39,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:51:41,270 WARN L290 TraceCheckUtils]: 84: Hoare triple {11701#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-08 05:51:41,271 INFO L290 TraceCheckUtils]: 83: Hoare triple {11705#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {11701#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:41,273 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #97#return; {11705#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:41,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:51:41,273 INFO L272 TraceCheckUtils]: 78: Hoare triple {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:41,274 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:41,275 INFO L290 TraceCheckUtils]: 76: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,275 INFO L290 TraceCheckUtils]: 74: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:51:41,275 INFO L272 TraceCheckUtils]: 73: Hoare triple {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:41,276 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:41,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,277 INFO L290 TraceCheckUtils]: 70: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:41,277 INFO L290 TraceCheckUtils]: 69: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:51:41,277 INFO L272 TraceCheckUtils]: 68: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:41,278 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11296#true} {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #91#return; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:41,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:41,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:41,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:41,278 INFO L272 TraceCheckUtils]: 63: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:41,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !false; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-08 05:51:43,282 WARN L290 TraceCheckUtils]: 61: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is UNKNOWN [2022-04-08 05:51:43,284 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #97#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,284 INFO L272 TraceCheckUtils]: 56: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,285 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #95#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,285 INFO L272 TraceCheckUtils]: 51: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,286 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #93#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,286 INFO L272 TraceCheckUtils]: 46: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,287 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #91#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,288 INFO L272 TraceCheckUtils]: 41: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} assume !false; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:51:43,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} assume !false; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:51:43,406 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11296#true} {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} #89#return; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:51:43,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,406 INFO L272 TraceCheckUtils]: 33: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,406 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11296#true} {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} #87#return; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:51:43,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,407 INFO L272 TraceCheckUtils]: 28: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {11296#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:51:43,408 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11296#true} {11296#true} #85#return; {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L272 TraceCheckUtils]: 22: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11296#true} {11296#true} #83#return; {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L272 TraceCheckUtils]: 17: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11296#true} {11296#true} #81#return; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11296#true} {11296#true} #79#return; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {11296#true} call #t~ret6 := main(); {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11296#true} {11296#true} #103#return; {11296#true} is VALID [2022-04-08 05:51:43,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-08 05:51:43,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11296#true} is VALID [2022-04-08 05:51:43,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {11296#true} call ULTIMATE.init(); {11296#true} is VALID [2022-04-08 05:51:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 84 proven. 40 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 05:51:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:51:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767708575] [2022-04-08 05:51:43,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:51:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273645325] [2022-04-08 05:51:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273645325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:51:43,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:51:43,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-04-08 05:51:43,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:51:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488604173] [2022-04-08 05:51:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488604173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:51:43,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:51:43,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 05:51:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950785392] [2022-04-08 05:51:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:51:43,411 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-08 05:51:43,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:51:43,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-08 05:51:43,478 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:51:43,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 05:51:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:51:43,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 05:51:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=472, Unknown=3, NotChecked=0, Total=600 [2022-04-08 05:51:43,479 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-08 05:51:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:47,158 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2022-04-08 05:51:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 05:51:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-08 05:51:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:51:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-08 05:51:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-08 05:51:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-08 05:51:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-08 05:51:47,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2022-04-08 05:51:47,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:51:47,290 INFO L225 Difference]: With dead ends: 162 [2022-04-08 05:51:47,290 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 05:51:47,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=158, Invalid=651, Unknown=3, NotChecked=0, Total=812 [2022-04-08 05:51:47,290 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 05:51:47,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 170 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 05:51:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 05:51:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-08 05:51:47,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:51:47,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:51:47,610 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:51:47,611 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:51:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:47,613 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-08 05:51:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-08 05:51:47,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:51:47,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:51:47,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-08 05:51:47,614 INFO L87 Difference]: Start difference. First operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-08 05:51:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:47,617 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-08 05:51:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-08 05:51:47,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:51:47,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:51:47,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:51:47,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:51:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 05:51:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2022-04-08 05:51:47,621 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 107 [2022-04-08 05:51:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:51:47,621 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2022-04-08 05:51:47,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-08 05:51:47,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 204 transitions. [2022-04-08 05:51:47,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:51:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2022-04-08 05:51:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 05:51:47,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:51:47,958 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:51:47,975 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:51:48,173 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:51:48,174 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:51:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:51:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 3 times [2022-04-08 05:51:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:51:48,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192286534] [2022-04-08 05:51:48,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:51:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 4 times [2022-04-08 05:51:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:51:48,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985593407] [2022-04-08 05:51:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:51:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:51:48,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:51:48,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671307621] [2022-04-08 05:51:48,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:51:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:51:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:51:48,186 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:51:48,187 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:51:48,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:51:48,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:51:48,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 05:51:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:51:48,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:51:52,793 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:51:54,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {12932#true} call ULTIMATE.init(); {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {12932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12932#true} {12932#true} #103#return; {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {12932#true} call #t~ret6 := main(); {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {12932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12932#true} is VALID [2022-04-08 05:51:54,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12932#true} {12932#true} #79#return; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {12932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12932#true} {12932#true} #81#return; {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {12932#true} ~cond := #in~cond; {12991#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:51:54,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {12991#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12995#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:51:54,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {12995#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12995#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:51:54,581 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12995#(not (= |assume_abort_if_not_#in~cond| 0))} {12932#true} #83#return; {13002#(<= 1 main_~x~0)} is VALID [2022-04-08 05:51:54,581 INFO L272 TraceCheckUtils]: 22: Hoare triple {13002#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,582 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12932#true} {13002#(<= 1 main_~x~0)} #85#return; {13002#(<= 1 main_~x~0)} is VALID [2022-04-08 05:51:54,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {13002#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,583 INFO L272 TraceCheckUtils]: 28: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,583 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12932#true} {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,583 INFO L272 TraceCheckUtils]: 33: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,584 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12932#true} {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,586 INFO L272 TraceCheckUtils]: 41: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,586 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,586 INFO L272 TraceCheckUtils]: 46: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,587 INFO L272 TraceCheckUtils]: 51: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,588 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,588 INFO L272 TraceCheckUtils]: 56: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,589 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,590 INFO L272 TraceCheckUtils]: 63: Hoare triple {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:54,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,592 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,592 INFO L272 TraceCheckUtils]: 68: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,593 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,593 INFO L272 TraceCheckUtils]: 73: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,594 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,594 INFO L272 TraceCheckUtils]: 78: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,595 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,596 INFO L290 TraceCheckUtils]: 83: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,596 INFO L290 TraceCheckUtils]: 84: Hoare triple {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,596 INFO L272 TraceCheckUtils]: 85: Hoare triple {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:54,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,598 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,598 INFO L272 TraceCheckUtils]: 90: Hoare triple {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,598 INFO L290 TraceCheckUtils]: 91: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:54,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:54,600 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,600 INFO L272 TraceCheckUtils]: 95: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,600 INFO L290 TraceCheckUtils]: 98: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,601 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12932#true} {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,601 INFO L272 TraceCheckUtils]: 100: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:51:54,601 INFO L290 TraceCheckUtils]: 101: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:51:54,601 INFO L290 TraceCheckUtils]: 102: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:51:54,601 INFO L290 TraceCheckUtils]: 103: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:51:54,602 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12932#true} {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13264#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:51:54,605 INFO L290 TraceCheckUtils]: 106: Hoare triple {13264#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-08 05:51:54,605 INFO L290 TraceCheckUtils]: 107: Hoare triple {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !false; {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-08 05:51:54,606 INFO L290 TraceCheckUtils]: 108: Hoare triple {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !(0 != ~b~0); {13275#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-08 05:51:54,606 INFO L272 TraceCheckUtils]: 109: Hoare triple {13275#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:51:54,607 INFO L290 TraceCheckUtils]: 110: Hoare triple {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:54,607 INFO L290 TraceCheckUtils]: 111: Hoare triple {13283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12933#false} is VALID [2022-04-08 05:51:54,607 INFO L290 TraceCheckUtils]: 112: Hoare triple {12933#false} assume !false; {12933#false} is VALID [2022-04-08 05:51:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 81 proven. 59 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-04-08 05:51:54,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:53:55,996 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:53:58,039 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:54:32,277 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:54:55,892 INFO L290 TraceCheckUtils]: 112: Hoare triple {12933#false} assume !false; {12933#false} is VALID [2022-04-08 05:54:55,892 INFO L290 TraceCheckUtils]: 111: Hoare triple {13283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12933#false} is VALID [2022-04-08 05:54:55,892 INFO L290 TraceCheckUtils]: 110: Hoare triple {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:54:55,893 INFO L272 TraceCheckUtils]: 109: Hoare triple {13299#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:54:55,893 INFO L290 TraceCheckUtils]: 108: Hoare triple {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {13299#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-08 05:54:55,894 INFO L290 TraceCheckUtils]: 107: Hoare triple {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:54:57,753 INFO L290 TraceCheckUtils]: 106: Hoare triple {13310#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:54:57,754 INFO L290 TraceCheckUtils]: 105: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {13310#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:57,754 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12932#true} {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #97#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 103: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 102: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 101: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L272 TraceCheckUtils]: 100: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12932#true} {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #95#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 98: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:54:57,755 INFO L290 TraceCheckUtils]: 96: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:54:57,756 INFO L272 TraceCheckUtils]: 95: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:57,756 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #93#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:57,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:57,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:57,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:54:57,757 INFO L272 TraceCheckUtils]: 90: Hoare triple {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:57,758 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #91#return; {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:57,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:57,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:57,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:54:57,759 INFO L272 TraceCheckUtils]: 85: Hoare triple {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:57,760 INFO L290 TraceCheckUtils]: 84: Hoare triple {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !false; {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-08 05:54:59,762 WARN L290 TraceCheckUtils]: 83: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is UNKNOWN [2022-04-08 05:54:59,763 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #97#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:54:59,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:54:59,763 INFO L290 TraceCheckUtils]: 80: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:54:59,763 INFO L290 TraceCheckUtils]: 79: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:54:59,763 INFO L272 TraceCheckUtils]: 78: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:59,764 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #95#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:54:59,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:54:59,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:54:59,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:54:59,764 INFO L272 TraceCheckUtils]: 73: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:59,764 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #93#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:54:59,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:54:59,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:54:59,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:54:59,765 INFO L272 TraceCheckUtils]: 68: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:59,766 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} #91#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:54:59,766 INFO L290 TraceCheckUtils]: 66: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:59,766 INFO L290 TraceCheckUtils]: 65: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:59,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:54:59,767 INFO L272 TraceCheckUtils]: 63: Hoare triple {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:54:59,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} assume !false; {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} is VALID [2022-04-08 05:55:01,769 WARN L290 TraceCheckUtils]: 61: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} is UNKNOWN [2022-04-08 05:55:01,770 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #97#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,770 INFO L272 TraceCheckUtils]: 56: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,771 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #95#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,771 INFO L272 TraceCheckUtils]: 51: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,772 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #93#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,772 INFO L272 TraceCheckUtils]: 46: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,773 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #91#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,773 INFO L272 TraceCheckUtils]: 41: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !false; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !false; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,775 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12932#true} {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #89#return; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L272 TraceCheckUtils]: 33: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12932#true} {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #87#return; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,776 INFO L272 TraceCheckUtils]: 28: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {12932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-08 05:55:01,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12932#true} {12932#true} #85#return; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12932#true} {12932#true} #83#return; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12932#true} {12932#true} #81#return; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L272 TraceCheckUtils]: 12: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {12932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12932#true} {12932#true} #79#return; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {12932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {12932#true} call #t~ret6 := main(); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12932#true} {12932#true} #103#return; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {12932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12932#true} is VALID [2022-04-08 05:55:01,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {12932#true} call ULTIMATE.init(); {12932#true} is VALID [2022-04-08 05:55:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 75 proven. 50 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-04-08 05:55:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:55:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985593407] [2022-04-08 05:55:01,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:55:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671307621] [2022-04-08 05:55:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671307621] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:55:01,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:55:01,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-08 05:55:01,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:55:01,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192286534] [2022-04-08 05:55:01,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192286534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:55:01,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:55:01,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 05:55:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759642780] [2022-04-08 05:55:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:55:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 113 [2022-04-08 05:55:01,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:55:01,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 05:55:01,851 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:55:01,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 05:55:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 05:55:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=714, Unknown=2, NotChecked=0, Total=870 [2022-04-08 05:55:01,852 INFO L87 Difference]: Start difference. First operand 159 states and 204 transitions. Second operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 05:55:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:10,553 INFO L93 Difference]: Finished difference Result 192 states and 250 transitions. [2022-04-08 05:55:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 05:55:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 113 [2022-04-08 05:55:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:55:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 05:55:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-08 05:55:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 05:55:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-08 05:55:10,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2022-04-08 05:55:10,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:10,694 INFO L225 Difference]: With dead ends: 192 [2022-04-08 05:55:10,694 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 05:55:10,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=202, Invalid=986, Unknown=2, NotChecked=0, Total=1190 [2022-04-08 05:55:10,695 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 45 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 05:55:10,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 05:55:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 05:55:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-04-08 05:55:11,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:55:11,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:55:11,073 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:55:11,073 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:55:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:11,077 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2022-04-08 05:55:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2022-04-08 05:55:11,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:11,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:11,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 189 states. [2022-04-08 05:55:11,078 INFO L87 Difference]: Start difference. First operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 189 states. [2022-04-08 05:55:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:11,081 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2022-04-08 05:55:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2022-04-08 05:55:11,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:11,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:11,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:55:11,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:55:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:55:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2022-04-08 05:55:11,085 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 113 [2022-04-08 05:55:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:55:11,086 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2022-04-08 05:55:11,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 05:55:11,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 245 transitions. [2022-04-08 05:55:11,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2022-04-08 05:55:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 05:55:11,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:55:11,546 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:55:11,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 05:55:11,763 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:55:11,763 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:55:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:55:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 5 times [2022-04-08 05:55:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:11,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377778386] [2022-04-08 05:55:11,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:55:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 6 times [2022-04-08 05:55:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:55:11,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246021333] [2022-04-08 05:55:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:55:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:55:11,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:55:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132939862] [2022-04-08 05:55:11,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:55:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:55:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:55:11,777 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:55:11,778 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:55:11,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:55:11,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:55:11,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:55:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:55:11,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:55:12,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {14787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14787#true} {14787#true} #103#return; {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {14787#true} call #t~ret6 := main(); {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {14787#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14787#true} {14787#true} #79#return; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {14787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L272 TraceCheckUtils]: 12: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14787#true} {14787#true} #81#return; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L272 TraceCheckUtils]: 17: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14787#true} {14787#true} #83#return; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14787#true} {14787#true} #85#return; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {14787#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L272 TraceCheckUtils]: 28: Hoare triple {14787#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14787#true} {14787#true} #87#return; {14787#true} is VALID [2022-04-08 05:55:12,141 INFO L272 TraceCheckUtils]: 33: Hoare triple {14787#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14787#true} {14787#true} #89#return; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {14787#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L272 TraceCheckUtils]: 41: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14787#true} {14787#true} #91#return; {14787#true} is VALID [2022-04-08 05:55:12,142 INFO L272 TraceCheckUtils]: 46: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14787#true} {14787#true} #93#return; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L272 TraceCheckUtils]: 51: Hoare triple {14787#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14787#true} {14787#true} #95#return; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L272 TraceCheckUtils]: 56: Hoare triple {14787#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,144 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14787#true} {14787#true} #97#return; {14787#true} is VALID [2022-04-08 05:55:12,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {14787#true} assume !(~c~0 >= ~b~0); {14975#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:12,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {14975#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !false; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !false; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,145 INFO L272 TraceCheckUtils]: 66: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,146 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #91#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,146 INFO L272 TraceCheckUtils]: 71: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,147 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #93#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,147 INFO L272 TraceCheckUtils]: 76: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,147 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #95#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,147 INFO L272 TraceCheckUtils]: 81: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,148 INFO L290 TraceCheckUtils]: 82: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,148 INFO L290 TraceCheckUtils]: 83: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,148 INFO L290 TraceCheckUtils]: 84: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,148 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #97#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,149 INFO L290 TraceCheckUtils]: 87: Hoare triple {15053#(< 0 main_~c~0)} assume !false; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,149 INFO L272 TraceCheckUtils]: 88: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 89: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 90: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 91: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #91#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,150 INFO L272 TraceCheckUtils]: 93: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 94: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 95: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,151 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #93#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,151 INFO L272 TraceCheckUtils]: 98: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,151 INFO L290 TraceCheckUtils]: 99: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,151 INFO L290 TraceCheckUtils]: 101: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,152 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #95#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,152 INFO L272 TraceCheckUtils]: 103: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,152 INFO L290 TraceCheckUtils]: 106: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,152 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #97#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,153 INFO L290 TraceCheckUtils]: 108: Hoare triple {15053#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,153 INFO L290 TraceCheckUtils]: 109: Hoare triple {15053#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15123#(< 0 main_~b~0)} is VALID [2022-04-08 05:55:12,153 INFO L290 TraceCheckUtils]: 110: Hoare triple {15123#(< 0 main_~b~0)} assume !false; {15123#(< 0 main_~b~0)} is VALID [2022-04-08 05:55:12,154 INFO L290 TraceCheckUtils]: 111: Hoare triple {15123#(< 0 main_~b~0)} assume !(0 != ~b~0); {14788#false} is VALID [2022-04-08 05:55:12,154 INFO L272 TraceCheckUtils]: 112: Hoare triple {14788#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14788#false} is VALID [2022-04-08 05:55:12,154 INFO L290 TraceCheckUtils]: 113: Hoare triple {14788#false} ~cond := #in~cond; {14788#false} is VALID [2022-04-08 05:55:12,154 INFO L290 TraceCheckUtils]: 114: Hoare triple {14788#false} assume 0 == ~cond; {14788#false} is VALID [2022-04-08 05:55:12,154 INFO L290 TraceCheckUtils]: 115: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2022-04-08 05:55:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 05:55:12,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:55:12,455 INFO L290 TraceCheckUtils]: 115: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2022-04-08 05:55:12,455 INFO L290 TraceCheckUtils]: 114: Hoare triple {14788#false} assume 0 == ~cond; {14788#false} is VALID [2022-04-08 05:55:12,455 INFO L290 TraceCheckUtils]: 113: Hoare triple {14788#false} ~cond := #in~cond; {14788#false} is VALID [2022-04-08 05:55:12,455 INFO L272 TraceCheckUtils]: 112: Hoare triple {14788#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14788#false} is VALID [2022-04-08 05:55:12,456 INFO L290 TraceCheckUtils]: 111: Hoare triple {15123#(< 0 main_~b~0)} assume !(0 != ~b~0); {14788#false} is VALID [2022-04-08 05:55:12,456 INFO L290 TraceCheckUtils]: 110: Hoare triple {15123#(< 0 main_~b~0)} assume !false; {15123#(< 0 main_~b~0)} is VALID [2022-04-08 05:55:12,456 INFO L290 TraceCheckUtils]: 109: Hoare triple {15053#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15123#(< 0 main_~b~0)} is VALID [2022-04-08 05:55:12,459 INFO L290 TraceCheckUtils]: 108: Hoare triple {15053#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,460 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #97#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,460 INFO L290 TraceCheckUtils]: 106: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,460 INFO L290 TraceCheckUtils]: 105: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,460 INFO L290 TraceCheckUtils]: 104: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,460 INFO L272 TraceCheckUtils]: 103: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,460 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #95#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 101: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 100: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 99: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L272 TraceCheckUtils]: 98: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #93#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 96: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 95: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L290 TraceCheckUtils]: 94: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,461 INFO L272 TraceCheckUtils]: 93: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,462 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #91#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,462 INFO L290 TraceCheckUtils]: 90: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,462 INFO L290 TraceCheckUtils]: 89: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,462 INFO L272 TraceCheckUtils]: 88: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {15053#(< 0 main_~c~0)} assume !false; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15053#(< 0 main_~c~0)} is VALID [2022-04-08 05:55:12,471 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #97#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 83: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L272 TraceCheckUtils]: 81: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #95#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L290 TraceCheckUtils]: 77: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,472 INFO L272 TraceCheckUtils]: 76: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,473 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #93#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,473 INFO L272 TraceCheckUtils]: 71: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,474 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #91#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,474 INFO L290 TraceCheckUtils]: 69: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,474 INFO L290 TraceCheckUtils]: 68: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,474 INFO L272 TraceCheckUtils]: 66: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !false; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:55:12,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !false; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:55:12,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {14975#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:55:12,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {14787#true} assume !(~c~0 >= ~b~0); {14975#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:12,476 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14787#true} {14787#true} #97#return; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L272 TraceCheckUtils]: 56: Hoare triple {14787#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14787#true} {14787#true} #95#return; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L272 TraceCheckUtils]: 51: Hoare triple {14787#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14787#true} {14787#true} #93#return; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L272 TraceCheckUtils]: 46: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14787#true} {14787#true} #91#return; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L272 TraceCheckUtils]: 41: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {14787#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14787#true} {14787#true} #89#return; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L272 TraceCheckUtils]: 33: Hoare triple {14787#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14787#true} {14787#true} #87#return; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L272 TraceCheckUtils]: 28: Hoare triple {14787#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {14787#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14787#true} {14787#true} #85#return; {14787#true} is VALID [2022-04-08 05:55:12,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L272 TraceCheckUtils]: 22: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14787#true} {14787#true} #83#return; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L272 TraceCheckUtils]: 17: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14787#true} {14787#true} #81#return; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {14787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14787#true} {14787#true} #79#return; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {14787#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {14787#true} call #t~ret6 := main(); {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14787#true} {14787#true} #103#return; {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {14787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14787#true} is VALID [2022-04-08 05:55:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 05:55:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:55:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246021333] [2022-04-08 05:55:12,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:55:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132939862] [2022-04-08 05:55:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132939862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:55:12,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:55:12,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-08 05:55:12,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:55:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377778386] [2022-04-08 05:55:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377778386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:55:12,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:55:12,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:55:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009633807] [2022-04-08 05:55:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:55:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-08 05:55:12,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:55:12,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-08 05:55:12,536 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:55:12,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:55:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:55:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:55:12,536 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-08 05:55:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:13,994 INFO L93 Difference]: Finished difference Result 248 states and 345 transitions. [2022-04-08 05:55:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:55:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-08 05:55:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:55:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-08 05:55:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-08 05:55:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-08 05:55:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-08 05:55:13,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-08 05:55:14,107 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:55:14,111 INFO L225 Difference]: With dead ends: 248 [2022-04-08 05:55:14,111 INFO L226 Difference]: Without dead ends: 240 [2022-04-08 05:55:14,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-04-08 05:55:14,113 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:55:14,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:55:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-08 05:55:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2022-04-08 05:55:14,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:55:14,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:55:14,610 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:55:14,611 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:55:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:14,616 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2022-04-08 05:55:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 336 transitions. [2022-04-08 05:55:14,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:14,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:14,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 240 states. [2022-04-08 05:55:14,617 INFO L87 Difference]: Start difference. First operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 240 states. [2022-04-08 05:55:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:14,623 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2022-04-08 05:55:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 336 transitions. [2022-04-08 05:55:14,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:14,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:14,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:55:14,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:55:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:55:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 303 transitions. [2022-04-08 05:55:14,629 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 303 transitions. Word has length 116 [2022-04-08 05:55:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:55:14,629 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 303 transitions. [2022-04-08 05:55:14,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-08 05:55:14,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 303 transitions. [2022-04-08 05:55:15,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 303 transitions. [2022-04-08 05:55:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 05:55:15,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:55:15,218 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:55:15,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 05:55:15,418 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:55:15,418 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:55:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:55:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 3 times [2022-04-08 05:55:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:15,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842466132] [2022-04-08 05:55:15,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:55:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 4 times [2022-04-08 05:55:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:55:15,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928650177] [2022-04-08 05:55:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:55:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:55:15,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:55:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389769570] [2022-04-08 05:55:15,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:55:15,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:55:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:55:15,429 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:55:15,430 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:55:15,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:55:15,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:55:15,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 05:55:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:55:15,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:55:15,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {16926#true} call ULTIMATE.init(); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {16926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16926#true} {16926#true} #103#return; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {16926#true} call #t~ret6 := main(); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {16926#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16926#true} {16926#true} #79#return; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {16926#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L272 TraceCheckUtils]: 12: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16926#true} {16926#true} #81#return; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L272 TraceCheckUtils]: 17: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16926#true} {16926#true} #83#return; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L272 TraceCheckUtils]: 22: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16926#true} {16926#true} #85#return; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {16926#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L272 TraceCheckUtils]: 28: Hoare triple {16926#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16926#true} {16926#true} #87#return; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L272 TraceCheckUtils]: 33: Hoare triple {16926#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16926#true} {16926#true} #89#return; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L272 TraceCheckUtils]: 41: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,740 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L272 TraceCheckUtils]: 51: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L272 TraceCheckUtils]: 56: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {16926#true} assume !(~c~0 >= ~b~0); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {16926#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L272 TraceCheckUtils]: 66: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L272 TraceCheckUtils]: 71: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L272 TraceCheckUtils]: 76: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L272 TraceCheckUtils]: 81: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,742 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {16926#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L272 TraceCheckUtils]: 88: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 89: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 90: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 91: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L272 TraceCheckUtils]: 93: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 94: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 95: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L272 TraceCheckUtils]: 98: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,743 INFO L290 TraceCheckUtils]: 99: Hoare triple {16926#true} ~cond := #in~cond; {17228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:15,744 INFO L290 TraceCheckUtils]: 100: Hoare triple {17228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:15,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:15,745 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} {16926#true} #95#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:15,745 INFO L272 TraceCheckUtils]: 103: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,745 INFO L290 TraceCheckUtils]: 104: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,745 INFO L290 TraceCheckUtils]: 105: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,745 INFO L290 TraceCheckUtils]: 106: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,745 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16926#true} {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:15,746 INFO L290 TraceCheckUtils]: 108: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:15,746 INFO L290 TraceCheckUtils]: 109: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:15,746 INFO L290 TraceCheckUtils]: 110: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:15,747 INFO L290 TraceCheckUtils]: 111: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:15,747 INFO L290 TraceCheckUtils]: 112: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:15,747 INFO L272 TraceCheckUtils]: 113: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:15,747 INFO L290 TraceCheckUtils]: 114: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:15,747 INFO L290 TraceCheckUtils]: 115: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:15,747 INFO L290 TraceCheckUtils]: 116: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:15,748 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16926#true} {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:15,748 INFO L272 TraceCheckUtils]: 118: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:55:15,749 INFO L290 TraceCheckUtils]: 119: Hoare triple {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:15,749 INFO L290 TraceCheckUtils]: 120: Hoare triple {17293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16927#false} is VALID [2022-04-08 05:55:15,749 INFO L290 TraceCheckUtils]: 121: Hoare triple {16927#false} assume !false; {16927#false} is VALID [2022-04-08 05:55:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-08 05:55:15,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:55:28,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {16927#false} assume !false; {16927#false} is VALID [2022-04-08 05:55:28,562 INFO L290 TraceCheckUtils]: 120: Hoare triple {17293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16927#false} is VALID [2022-04-08 05:55:28,562 INFO L290 TraceCheckUtils]: 119: Hoare triple {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:28,562 INFO L272 TraceCheckUtils]: 118: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:55:28,563 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16926#true} {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:28,563 INFO L290 TraceCheckUtils]: 116: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,563 INFO L290 TraceCheckUtils]: 115: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,563 INFO L290 TraceCheckUtils]: 114: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,563 INFO L272 TraceCheckUtils]: 113: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,564 INFO L290 TraceCheckUtils]: 112: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:28,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:28,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:28,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:55:28,565 INFO L290 TraceCheckUtils]: 108: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:28,565 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16926#true} {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:28,566 INFO L290 TraceCheckUtils]: 106: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,566 INFO L290 TraceCheckUtils]: 105: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,566 INFO L290 TraceCheckUtils]: 104: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,566 INFO L272 TraceCheckUtils]: 103: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,566 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} {16926#true} #95#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 101: Hoare triple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 100: Hoare triple {17366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 99: Hoare triple {16926#true} ~cond := #in~cond; {17366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:55:28,567 INFO L272 TraceCheckUtils]: 98: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,567 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,567 INFO L290 TraceCheckUtils]: 94: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L272 TraceCheckUtils]: 93: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 91: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 90: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 89: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L272 TraceCheckUtils]: 88: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 87: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {16926#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 83: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L272 TraceCheckUtils]: 81: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 78: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,568 INFO L272 TraceCheckUtils]: 76: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L272 TraceCheckUtils]: 71: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L272 TraceCheckUtils]: 66: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {16926#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {16926#true} assume !(~c~0 >= ~b~0); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L272 TraceCheckUtils]: 56: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L272 TraceCheckUtils]: 51: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L272 TraceCheckUtils]: 46: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L272 TraceCheckUtils]: 41: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-08 05:55:28,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16926#true} {16926#true} #89#return; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L272 TraceCheckUtils]: 33: Hoare triple {16926#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16926#true} {16926#true} #87#return; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L272 TraceCheckUtils]: 28: Hoare triple {16926#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {16926#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16926#true} {16926#true} #85#return; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L272 TraceCheckUtils]: 22: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16926#true} {16926#true} #83#return; {16926#true} is VALID [2022-04-08 05:55:28,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L272 TraceCheckUtils]: 17: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16926#true} {16926#true} #81#return; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L272 TraceCheckUtils]: 12: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {16926#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16926#true} {16926#true} #79#return; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {16926#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {16926#true} call #t~ret6 := main(); {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16926#true} {16926#true} #103#return; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-08 05:55:28,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {16926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16926#true} is VALID [2022-04-08 05:55:28,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {16926#true} call ULTIMATE.init(); {16926#true} is VALID [2022-04-08 05:55:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-08 05:55:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:55:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928650177] [2022-04-08 05:55:28,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:55:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389769570] [2022-04-08 05:55:28,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389769570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:55:28,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:55:28,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:55:28,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:55:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842466132] [2022-04-08 05:55:28,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842466132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:55:28,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:55:28,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:55:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120914215] [2022-04-08 05:55:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:55:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-08 05:55:28,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:55:28,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 05:55:28,615 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:55:28,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:55:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:55:28,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:55:28,619 INFO L87 Difference]: Start difference. First operand 221 states and 303 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 05:55:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:29,689 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2022-04-08 05:55:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:55:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-08 05:55:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:55:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 05:55:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 05:55:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 05:55:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 05:55:29,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-08 05:55:29,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:29,750 INFO L225 Difference]: With dead ends: 235 [2022-04-08 05:55:29,750 INFO L226 Difference]: Without dead ends: 232 [2022-04-08 05:55:29,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 235 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:55:29,751 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:55:29,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 156 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:55:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-08 05:55:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-04-08 05:55:30,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:55:30,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:55:30,288 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:55:30,288 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:55:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:30,294 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-08 05:55:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-08 05:55:30,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:30,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:30,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-08 05:55:30,297 INFO L87 Difference]: Start difference. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-08 05:55:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:30,303 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-08 05:55:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-08 05:55:30,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:30,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:30,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:55:30,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:55:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:55:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2022-04-08 05:55:30,309 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 122 [2022-04-08 05:55:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:55:30,309 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2022-04-08 05:55:30,310 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 05:55:30,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 309 transitions. [2022-04-08 05:55:30,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2022-04-08 05:55:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 05:55:30,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:55:30,918 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:55:30,934 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:55:31,119 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:55:31,119 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:55:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:55:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 5 times [2022-04-08 05:55:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366896135] [2022-04-08 05:55:31,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:55:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 6 times [2022-04-08 05:55:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:55:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202198131] [2022-04-08 05:55:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:55:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:55:31,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:55:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408860427] [2022-04-08 05:55:31,145 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:55:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:55:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:55:31,149 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:55:31,151 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:55:31,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:55:31,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:55:31,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 05:55:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:55:31,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:55:32,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {19068#true} call ULTIMATE.init(); {19068#true} is VALID [2022-04-08 05:55:32,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {19068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19068#true} {19068#true} #103#return; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {19068#true} call #t~ret6 := main(); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {19068#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L272 TraceCheckUtils]: 6: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19068#true} {19068#true} #79#return; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {19068#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L272 TraceCheckUtils]: 12: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19068#true} {19068#true} #81#return; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L272 TraceCheckUtils]: 17: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19068#true} {19068#true} #83#return; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L272 TraceCheckUtils]: 22: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19068#true} {19068#true} #85#return; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {19068#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,323 INFO L272 TraceCheckUtils]: 28: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,324 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19068#true} {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,324 INFO L272 TraceCheckUtils]: 33: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,325 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19068#true} {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,326 INFO L272 TraceCheckUtils]: 41: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,327 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,327 INFO L272 TraceCheckUtils]: 46: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,328 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,328 INFO L272 TraceCheckUtils]: 51: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,328 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,328 INFO L272 TraceCheckUtils]: 56: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,329 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {19258#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:32,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {19258#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !false; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,331 INFO L272 TraceCheckUtils]: 66: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,332 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #91#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,332 INFO L272 TraceCheckUtils]: 71: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,333 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #93#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,333 INFO L272 TraceCheckUtils]: 76: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,334 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #95#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,334 INFO L272 TraceCheckUtils]: 81: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,334 INFO L290 TraceCheckUtils]: 84: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,335 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #97#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-08 05:55:32,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,336 INFO L290 TraceCheckUtils]: 87: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,336 INFO L272 TraceCheckUtils]: 88: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,336 INFO L290 TraceCheckUtils]: 89: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,336 INFO L290 TraceCheckUtils]: 90: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,336 INFO L290 TraceCheckUtils]: 91: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,336 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #91#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,336 INFO L272 TraceCheckUtils]: 93: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,336 INFO L290 TraceCheckUtils]: 94: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L290 TraceCheckUtils]: 96: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #93#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,337 INFO L272 TraceCheckUtils]: 98: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,338 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #95#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,338 INFO L272 TraceCheckUtils]: 103: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,338 INFO L290 TraceCheckUtils]: 104: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,338 INFO L290 TraceCheckUtils]: 105: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,338 INFO L290 TraceCheckUtils]: 106: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,339 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #97#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {19403#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 1))} is VALID [2022-04-08 05:55:32,341 INFO L290 TraceCheckUtils]: 109: Hoare triple {19403#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,342 INFO L290 TraceCheckUtils]: 111: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,342 INFO L290 TraceCheckUtils]: 112: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,342 INFO L272 TraceCheckUtils]: 113: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,342 INFO L290 TraceCheckUtils]: 116: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,343 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {19068#true} {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} #91#return; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,343 INFO L272 TraceCheckUtils]: 118: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:32,343 INFO L290 TraceCheckUtils]: 119: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:32,343 INFO L290 TraceCheckUtils]: 120: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:32,343 INFO L290 TraceCheckUtils]: 121: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:32,344 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19068#true} {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} #93#return; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-08 05:55:32,351 INFO L272 TraceCheckUtils]: 123: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:55:32,351 INFO L290 TraceCheckUtils]: 124: Hoare triple {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:32,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {19454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19069#false} is VALID [2022-04-08 05:55:32,352 INFO L290 TraceCheckUtils]: 126: Hoare triple {19069#false} assume !false; {19069#false} is VALID [2022-04-08 05:55:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 05:55:32,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:55:34,272 INFO L290 TraceCheckUtils]: 126: Hoare triple {19069#false} assume !false; {19069#false} is VALID [2022-04-08 05:55:34,273 INFO L290 TraceCheckUtils]: 125: Hoare triple {19454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19069#false} is VALID [2022-04-08 05:55:34,273 INFO L290 TraceCheckUtils]: 124: Hoare triple {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:34,274 INFO L272 TraceCheckUtils]: 123: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:55:34,274 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19068#true} {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #93#return; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:34,274 INFO L290 TraceCheckUtils]: 121: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:34,274 INFO L290 TraceCheckUtils]: 120: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:34,274 INFO L290 TraceCheckUtils]: 119: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:34,274 INFO L272 TraceCheckUtils]: 118: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:34,275 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {19068#true} {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #91#return; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:34,275 INFO L290 TraceCheckUtils]: 116: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:34,275 INFO L290 TraceCheckUtils]: 115: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:34,275 INFO L290 TraceCheckUtils]: 114: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:34,275 INFO L272 TraceCheckUtils]: 113: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:34,276 INFO L290 TraceCheckUtils]: 112: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:34,276 INFO L290 TraceCheckUtils]: 111: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:34,276 INFO L290 TraceCheckUtils]: 110: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:55:36,278 WARN L290 TraceCheckUtils]: 109: Hoare triple {19513#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-08 05:55:36,278 INFO L290 TraceCheckUtils]: 108: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19513#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 05:55:36,279 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #97#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:36,279 INFO L290 TraceCheckUtils]: 106: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:36,279 INFO L290 TraceCheckUtils]: 105: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:36,279 INFO L290 TraceCheckUtils]: 104: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:36,279 INFO L272 TraceCheckUtils]: 103: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:36,280 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #95#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:36,280 INFO L290 TraceCheckUtils]: 101: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:36,280 INFO L290 TraceCheckUtils]: 100: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:36,280 INFO L290 TraceCheckUtils]: 99: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:36,280 INFO L272 TraceCheckUtils]: 98: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:36,281 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #93#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:36,281 INFO L290 TraceCheckUtils]: 96: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:36,281 INFO L290 TraceCheckUtils]: 95: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:36,281 INFO L290 TraceCheckUtils]: 94: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:36,281 INFO L272 TraceCheckUtils]: 93: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:36,282 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #91#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:36,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:36,282 INFO L290 TraceCheckUtils]: 90: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:36,282 INFO L290 TraceCheckUtils]: 89: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:36,282 INFO L272 TraceCheckUtils]: 88: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:36,282 INFO L290 TraceCheckUtils]: 87: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,479 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #97#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,479 INFO L290 TraceCheckUtils]: 84: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,479 INFO L272 TraceCheckUtils]: 81: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,480 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #95#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,480 INFO L290 TraceCheckUtils]: 79: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,480 INFO L272 TraceCheckUtils]: 76: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,480 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #93#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,480 INFO L290 TraceCheckUtils]: 74: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L290 TraceCheckUtils]: 72: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L272 TraceCheckUtils]: 71: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #91#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L290 TraceCheckUtils]: 67: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,481 INFO L272 TraceCheckUtils]: 66: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !false; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:55:37,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-08 05:55:37,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {19658#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-08 05:55:37,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19658#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} is VALID [2022-04-08 05:55:37,537 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #97#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,537 INFO L272 TraceCheckUtils]: 56: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,538 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #95#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,538 INFO L272 TraceCheckUtils]: 51: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,539 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #93#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,539 INFO L272 TraceCheckUtils]: 46: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,540 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #91#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,540 INFO L272 TraceCheckUtils]: 41: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !false; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:55:37,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !false; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:55:37,542 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19068#true} {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #89#return; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:55:37,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,542 INFO L272 TraceCheckUtils]: 33: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19068#true} {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #87#return; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L272 TraceCheckUtils]: 28: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {19068#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:55:37,543 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19068#true} {19068#true} #85#return; {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L272 TraceCheckUtils]: 22: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19068#true} {19068#true} #83#return; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19068#true} {19068#true} #81#return; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {19068#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19068#true} {19068#true} #79#return; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {19068#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {19068#true} is VALID [2022-04-08 05:55:37,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {19068#true} call #t~ret6 := main(); {19068#true} is VALID [2022-04-08 05:55:37,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19068#true} {19068#true} #103#return; {19068#true} is VALID [2022-04-08 05:55:37,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-08 05:55:37,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {19068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19068#true} is VALID [2022-04-08 05:55:37,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {19068#true} call ULTIMATE.init(); {19068#true} is VALID [2022-04-08 05:55:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 36 proven. 29 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 05:55:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:55:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202198131] [2022-04-08 05:55:37,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:55:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408860427] [2022-04-08 05:55:37,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408860427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:55:37,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:55:37,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-04-08 05:55:37,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:55:37,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366896135] [2022-04-08 05:55:37,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366896135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:55:37,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:55:37,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 05:55:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972572134] [2022-04-08 05:55:37,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:55:37,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-08 05:55:37,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:55:37,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:55:37,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:37,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 05:55:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 05:55:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-08 05:55:37,621 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:55:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:41,300 INFO L93 Difference]: Finished difference Result 269 states and 358 transitions. [2022-04-08 05:55:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:55:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-08 05:55:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:55:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:55:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-08 05:55:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:55:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-08 05:55:41,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 125 transitions. [2022-04-08 05:55:41,450 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:55:41,455 INFO L225 Difference]: With dead ends: 269 [2022-04-08 05:55:41,455 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 05:55:41,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-04-08 05:55:41,455 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 05:55:41,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 378 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 05:55:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 05:55:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2022-04-08 05:55:42,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:55:42,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-08 05:55:42,078 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-08 05:55:42,078 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-08 05:55:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:42,083 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-08 05:55:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-08 05:55:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:42,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-08 05:55:42,084 INFO L87 Difference]: Start difference. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-08 05:55:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:55:42,089 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-08 05:55:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-08 05:55:42,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:55:42,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:55:42,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:55:42,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:55:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-08 05:55:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2022-04-08 05:55:42,095 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 127 [2022-04-08 05:55:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:55:42,096 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2022-04-08 05:55:42,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:55:42,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 353 transitions. [2022-04-08 05:55:42,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:55:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2022-04-08 05:55:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 05:55:42,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:55:42,807 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:55:42,825 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:55:43,015 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:55:43,016 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:55:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:55:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 7 times [2022-04-08 05:55:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:55:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320422921] [2022-04-08 05:55:43,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:55:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 8 times [2022-04-08 05:55:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:55:43,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850349231] [2022-04-08 05:55:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:55:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:55:43,040 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:55:43,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232556588] [2022-04-08 05:55:43,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:55:43,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:55:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:55:43,041 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:55:43,042 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:55:43,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:55:43,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:55:43,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 05:55:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:55:43,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:55:53,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {21461#true} call ULTIMATE.init(); {21461#true} is VALID [2022-04-08 05:55:53,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {21461#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21461#true} is VALID [2022-04-08 05:55:53,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21461#true} {21461#true} #103#return; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {21461#true} call #t~ret6 := main(); {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {21461#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {21461#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21461#true} {21461#true} #79#return; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {21461#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L272 TraceCheckUtils]: 12: Hoare triple {21461#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21461#true} {21461#true} #81#return; {21461#true} is VALID [2022-04-08 05:55:53,108 INFO L272 TraceCheckUtils]: 17: Hoare triple {21461#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {21461#true} ~cond := #in~cond; {21520#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:55:53,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {21520#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {21524#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:55:53,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {21524#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {21524#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:55:53,110 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21524#(not (= |assume_abort_if_not_#in~cond| 0))} {21461#true} #83#return; {21531#(<= 1 main_~x~0)} is VALID [2022-04-08 05:55:53,110 INFO L272 TraceCheckUtils]: 22: Hoare triple {21531#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,110 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21461#true} {21531#(<= 1 main_~x~0)} #85#return; {21531#(<= 1 main_~x~0)} is VALID [2022-04-08 05:55:53,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {21531#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,111 INFO L272 TraceCheckUtils]: 28: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,111 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21461#true} {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,112 INFO L272 TraceCheckUtils]: 33: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,112 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21461#true} {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,114 INFO L272 TraceCheckUtils]: 41: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,115 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,115 INFO L272 TraceCheckUtils]: 46: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,116 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,116 INFO L272 TraceCheckUtils]: 51: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,116 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,116 INFO L272 TraceCheckUtils]: 56: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,117 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,120 INFO L272 TraceCheckUtils]: 63: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,120 INFO L290 TraceCheckUtils]: 65: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,121 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,121 INFO L272 TraceCheckUtils]: 68: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,121 INFO L290 TraceCheckUtils]: 69: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,121 INFO L290 TraceCheckUtils]: 71: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,122 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,122 INFO L272 TraceCheckUtils]: 73: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,122 INFO L290 TraceCheckUtils]: 74: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,122 INFO L290 TraceCheckUtils]: 75: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,123 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,123 INFO L272 TraceCheckUtils]: 78: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,124 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,126 INFO L290 TraceCheckUtils]: 84: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} assume !false; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,126 INFO L272 TraceCheckUtils]: 85: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,126 INFO L290 TraceCheckUtils]: 88: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,127 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {21461#true} {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} #91#return; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,127 INFO L272 TraceCheckUtils]: 90: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,127 INFO L290 TraceCheckUtils]: 91: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,127 INFO L290 TraceCheckUtils]: 93: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,129 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} #93#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,129 INFO L272 TraceCheckUtils]: 95: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,129 INFO L290 TraceCheckUtils]: 96: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,129 INFO L290 TraceCheckUtils]: 97: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,130 INFO L290 TraceCheckUtils]: 98: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,130 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} #95#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,130 INFO L272 TraceCheckUtils]: 100: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,131 INFO L290 TraceCheckUtils]: 101: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,131 INFO L290 TraceCheckUtils]: 102: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,131 INFO L290 TraceCheckUtils]: 103: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,132 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} #97#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,132 INFO L290 TraceCheckUtils]: 105: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {21791#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 2))) (<= (* main_~y~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:55:53,135 INFO L290 TraceCheckUtils]: 106: Hoare triple {21791#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 2))) (<= (* main_~y~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,135 INFO L290 TraceCheckUtils]: 107: Hoare triple {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,135 INFO L290 TraceCheckUtils]: 108: Hoare triple {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,136 INFO L290 TraceCheckUtils]: 109: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,136 INFO L272 TraceCheckUtils]: 110: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,136 INFO L290 TraceCheckUtils]: 111: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,136 INFO L290 TraceCheckUtils]: 112: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,136 INFO L290 TraceCheckUtils]: 113: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,137 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21461#true} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,137 INFO L272 TraceCheckUtils]: 115: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,137 INFO L290 TraceCheckUtils]: 116: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-08 05:55:53,137 INFO L290 TraceCheckUtils]: 117: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-08 05:55:53,137 INFO L290 TraceCheckUtils]: 118: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-08 05:55:53,138 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {21461#true} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,138 INFO L272 TraceCheckUtils]: 120: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-08 05:55:53,138 INFO L290 TraceCheckUtils]: 121: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,138 INFO L290 TraceCheckUtils]: 122: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,138 INFO L290 TraceCheckUtils]: 123: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:55:53,139 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {21851#(and (<= (* main_~y~0 2) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:55:53,142 INFO L272 TraceCheckUtils]: 125: Hoare triple {21851#(and (<= (* main_~y~0 2) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:55:53,142 INFO L290 TraceCheckUtils]: 126: Hoare triple {21855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:55:53,142 INFO L290 TraceCheckUtils]: 127: Hoare triple {21859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21462#false} is VALID [2022-04-08 05:55:53,142 INFO L290 TraceCheckUtils]: 128: Hoare triple {21462#false} assume !false; {21462#false} is VALID [2022-04-08 05:55:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 145 proven. 85 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-08 05:55:53,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:56:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:56:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850349231] [2022-04-08 05:56:51,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:56:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232556588] [2022-04-08 05:56:51,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232556588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:56:51,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:56:51,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 05:56:51,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:56:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320422921] [2022-04-08 05:56:51,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320422921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:56:51,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:56:51,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 05:56:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983665318] [2022-04-08 05:56:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:56:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 129 [2022-04-08 05:56:51,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:56:51,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-08 05:56:51,451 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:56:51,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 05:56:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:56:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 05:56:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-04-08 05:56:51,452 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-08 05:56:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:56:58,399 INFO L93 Difference]: Finished difference Result 272 states and 360 transitions. [2022-04-08 05:56:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 05:56:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 129 [2022-04-08 05:56:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:56:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-08 05:56:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-04-08 05:56:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-08 05:56:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-04-08 05:56:58,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2022-04-08 05:56:58,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:56:58,579 INFO L225 Difference]: With dead ends: 272 [2022-04-08 05:56:58,579 INFO L226 Difference]: Without dead ends: 270 [2022-04-08 05:56:58,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-04-08 05:56:58,580 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:56:58,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 218 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 05:56:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-08 05:56:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2022-04-08 05:56:59,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:56:59,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:56:59,201 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:56:59,201 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:56:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:56:59,206 INFO L93 Difference]: Finished difference Result 270 states and 358 transitions. [2022-04-08 05:56:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 358 transitions. [2022-04-08 05:56:59,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:56:59,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:56:59,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 270 states. [2022-04-08 05:56:59,207 INFO L87 Difference]: Start difference. First operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 270 states. [2022-04-08 05:56:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:56:59,212 INFO L93 Difference]: Finished difference Result 270 states and 358 transitions. [2022-04-08 05:56:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 358 transitions. [2022-04-08 05:56:59,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:56:59,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:56:59,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:56:59,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:56:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-08 05:56:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 312 transitions. [2022-04-08 05:56:59,218 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 312 transitions. Word has length 129 [2022-04-08 05:56:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:56:59,218 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 312 transitions. [2022-04-08 05:56:59,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-08 05:56:59,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 312 transitions. [2022-04-08 05:56:59,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:56:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 312 transitions. [2022-04-08 05:56:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 05:56:59,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:56:59,886 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:56:59,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 05:57:00,086 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:57:00,086 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:57:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:57:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 9 times [2022-04-08 05:57:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:57:00,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848326686] [2022-04-08 05:57:00,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:57:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 10 times [2022-04-08 05:57:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:57:00,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211050835] [2022-04-08 05:57:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:57:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:57:00,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:57:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581139960] [2022-04-08 05:57:00,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:57:00,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:57:00,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:57:00,116 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:57:00,119 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:57:00,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:57:00,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:57:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-08 05:57:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:57:00,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:57:02,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {23509#true} call ULTIMATE.init(); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {23509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23509#true} {23509#true} #103#return; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {23509#true} call #t~ret6 := main(); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {23509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23509#true} {23509#true} #79#return; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {23509#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {23509#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,394 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23509#true} {23509#true} #81#return; {23509#true} is VALID [2022-04-08 05:57:02,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {23509#true} ~cond := #in~cond; {23568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:57:02,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {23568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {23572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:57:02,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {23572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:57:02,395 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23572#(not (= |assume_abort_if_not_#in~cond| 0))} {23509#true} #83#return; {23579#(<= 1 main_~x~0)} is VALID [2022-04-08 05:57:02,395 INFO L272 TraceCheckUtils]: 22: Hoare triple {23579#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,396 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23509#true} {23579#(<= 1 main_~x~0)} #85#return; {23579#(<= 1 main_~x~0)} is VALID [2022-04-08 05:57:02,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {23579#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,396 INFO L272 TraceCheckUtils]: 28: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,397 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23509#true} {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,397 INFO L272 TraceCheckUtils]: 33: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,398 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23509#true} {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,399 INFO L272 TraceCheckUtils]: 41: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,400 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23509#true} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,400 INFO L272 TraceCheckUtils]: 46: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,401 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23509#true} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,401 INFO L272 TraceCheckUtils]: 51: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,402 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,402 INFO L272 TraceCheckUtils]: 56: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,408 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23704#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:57:02,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {23704#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,411 INFO L272 TraceCheckUtils]: 66: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,412 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,412 INFO L272 TraceCheckUtils]: 71: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,413 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,413 INFO L272 TraceCheckUtils]: 76: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,413 INFO L290 TraceCheckUtils]: 79: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,414 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,414 INFO L272 TraceCheckUtils]: 81: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,415 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,416 INFO L272 TraceCheckUtils]: 88: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,417 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {23509#true} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,417 INFO L272 TraceCheckUtils]: 93: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,418 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23509#true} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,418 INFO L272 TraceCheckUtils]: 98: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,418 INFO L290 TraceCheckUtils]: 99: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,420 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,420 INFO L272 TraceCheckUtils]: 103: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,420 INFO L290 TraceCheckUtils]: 106: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,421 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,423 INFO L290 TraceCheckUtils]: 108: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {23849#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< (* main_~c~0 2) main_~y~0))} is VALID [2022-04-08 05:57:02,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {23849#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< (* main_~c~0 2) main_~y~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,425 INFO L290 TraceCheckUtils]: 110: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,426 INFO L290 TraceCheckUtils]: 111: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,426 INFO L290 TraceCheckUtils]: 112: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,426 INFO L272 TraceCheckUtils]: 113: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,426 INFO L290 TraceCheckUtils]: 114: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,426 INFO L290 TraceCheckUtils]: 115: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,426 INFO L290 TraceCheckUtils]: 116: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,427 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23509#true} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,427 INFO L272 TraceCheckUtils]: 118: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,427 INFO L290 TraceCheckUtils]: 119: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-08 05:57:02,427 INFO L290 TraceCheckUtils]: 120: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-08 05:57:02,427 INFO L290 TraceCheckUtils]: 121: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-08 05:57:02,428 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23509#true} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,428 INFO L272 TraceCheckUtils]: 123: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-08 05:57:02,428 INFO L290 TraceCheckUtils]: 124: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,428 INFO L290 TraceCheckUtils]: 125: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,429 INFO L290 TraceCheckUtils]: 126: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:02,429 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:57:02,431 INFO L272 TraceCheckUtils]: 128: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:57:02,431 INFO L290 TraceCheckUtils]: 129: Hoare triple {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:02,432 INFO L290 TraceCheckUtils]: 130: Hoare triple {23915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23510#false} is VALID [2022-04-08 05:57:02,432 INFO L290 TraceCheckUtils]: 131: Hoare triple {23510#false} assume !false; {23510#false} is VALID [2022-04-08 05:57:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 121 proven. 114 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-08 05:57:02,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:17,245 WARN L232 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 06:00:33,031 WARN L232 SmtUtils]: Spent 37.74s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)