/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/hard2_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:34:35,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:34:35,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:34:35,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:34:35,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:34:35,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:34:35,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:34:35,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:34:35,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:34:35,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:34:35,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:34:35,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:34:35,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:34:35,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:34:35,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:34:35,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:34:35,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:34:35,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:34:35,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:34:35,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:34:35,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:34:35,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:34:35,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:34:35,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:34:35,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:34:35,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:34:35,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:34:35,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:34:35,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:34:35,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:34:35,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:34:35,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:34:35,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:34:35,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:34:35,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:34:35,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:34:35,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:34:35,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:34:35,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:34:35,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:34:35,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:34:35,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:34:35,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:34:35,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:34:35,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:34:35,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:34:35,514 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:34:35,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:34:35,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:34:35,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:34:35,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:34:35,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:34:35,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:34:35,517 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:34:35,517 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 06:34:35,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:34:35,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:34:35,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:34:35,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:34:35,735 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:34:35,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-28 06:34:35,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278fc23f2/6bd57ac065db4749b4e1f3d1ee9863b4/FLAGe8f9e2cf9 [2022-04-28 06:34:36,147 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:34:36,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-28 06:34:36,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278fc23f2/6bd57ac065db4749b4e1f3d1ee9863b4/FLAGe8f9e2cf9 [2022-04-28 06:34:36,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278fc23f2/6bd57ac065db4749b4e1f3d1ee9863b4 [2022-04-28 06:34:36,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:34:36,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:34:36,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:34:36,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:34:36,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:34:36,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dadea4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36, skipping insertion in model container [2022-04-28 06:34:36,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:34:36,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:34:36,318 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/hard2_unwindbound20.c[526,539] [2022-04-28 06:34:36,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:34:36,336 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:34:36,344 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/hard2_unwindbound20.c[526,539] [2022-04-28 06:34:36,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:34:36,358 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:34:36,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36 WrapperNode [2022-04-28 06:34:36,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:34:36,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:34:36,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:34:36,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:34:36,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:34:36,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:34:36,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:34:36,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:34:36,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (1/1) ... [2022-04-28 06:34:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:34:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:36,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 06:34:36,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:34:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:34:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:34:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:34:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:34:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:34:36,485 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:34:36,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:34:36,595 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:34:36,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:34:36,601 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 06:34:36,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:34:36 BoogieIcfgContainer [2022-04-28 06:34:36,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:34:36,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:34:36,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:34:36,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:34:36,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:34:36" (1/3) ... [2022-04-28 06:34:36,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ba93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:34:36, skipping insertion in model container [2022-04-28 06:34:36,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:34:36" (2/3) ... [2022-04-28 06:34:36,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ba93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:34:36, skipping insertion in model container [2022-04-28 06:34:36,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:34:36" (3/3) ... [2022-04-28 06:34:36,608 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound20.c [2022-04-28 06:34:36,617 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:34:36,618 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:34:36,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:34:36,675 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fa4e71e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b302946 [2022-04-28 06:34:36,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:34:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:34:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:34:36,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:36,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:36,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-28 06:34:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643835652] [2022-04-28 06:34:36,709 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-28 06:34:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:36,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095434410] [2022-04-28 06:34:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:34:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:36,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 06:34:36,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:34:36,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 06:34:36,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:34:36,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 06:34:36,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:34:36,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 06:34:36,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-28 06:34:36,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-28 06:34:36,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 06:34:36,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-28 06:34:36,838 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-28 06:34:36,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 06:34:36,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 06:34:36,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 06:34:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:34:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095434410] [2022-04-28 06:34:36,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095434410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:36,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:36,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:34:36,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:36,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643835652] [2022-04-28 06:34:36,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643835652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:36,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:36,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:34:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581975582] [2022-04-28 06:34:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:34:36,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:36,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:36,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:36,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:34:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:34:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:34:36,887 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,024 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-28 06:34:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:34:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:34:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 06:34:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 06:34:37,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 06:34:37,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,148 INFO L225 Difference]: With dead ends: 57 [2022-04-28 06:34:37,149 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:34:37,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:34:37,155 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:37,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:34:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 06:34:37,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:37,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,182 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,182 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,200 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 06:34:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 06:34:37,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:37,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:37,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 06:34:37,202 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 06:34:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,205 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 06:34:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 06:34:37,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:37,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:37,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:37,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-28 06:34:37,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-28 06:34:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:37,210 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-28 06:34:37,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-28 06:34:37,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-28 06:34:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:34:37,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:37,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:37,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:34:37,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-28 06:34:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896728397] [2022-04-28 06:34:37,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-28 06:34:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:37,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136392879] [2022-04-28 06:34:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:34:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:37,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 06:34:37,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 06:34:37,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 06:34:37,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:34:37,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 06:34:37,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 06:34:37,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 06:34:37,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-28 06:34:37,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:34:37,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:34:37,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 20);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:34:37,369 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:34:37,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:34:37,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-28 06:34:37,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 06:34:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:34:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:37,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136392879] [2022-04-28 06:34:37,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136392879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:37,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:37,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:34:37,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896728397] [2022-04-28 06:34:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896728397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:37,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:37,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:34:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587702772] [2022-04-28 06:34:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:37,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:34:37,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:34:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:34:37,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:34:37,384 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,722 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 06:34:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:34:37,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:34:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:34:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:34:37,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 06:34:37,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,779 INFO L225 Difference]: With dead ends: 41 [2022-04-28 06:34:37,779 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 06:34:37,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:34:37,780 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:37,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:34:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 06:34:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-28 06:34:37,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:37,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,787 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,787 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,790 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 06:34:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 06:34:37,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:37,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:37,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 06:34:37,791 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 06:34:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:37,793 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 06:34:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 06:34:37,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:37,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:37,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:37,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-28 06:34:37,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-28 06:34:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:37,796 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-28 06:34:37,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-28 06:34:37,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 06:34:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 06:34:37,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:37,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:37,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 06:34:37,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-28 06:34:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:37,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408141571] [2022-04-28 06:34:37,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-28 06:34:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:37,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313098757] [2022-04-28 06:34:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:34:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:37,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:34:37,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:37,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-28 06:34:37,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {502#false} is VALID [2022-04-28 06:34:37,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-28 06:34:37,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 20);havoc #t~post6; {502#false} is VALID [2022-04-28 06:34:37,925 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-28 06:34:37,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-28 06:34:37,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-28 06:34:37,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 06:34:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:34:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:37,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313098757] [2022-04-28 06:34:37,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313098757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:37,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:37,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:34:37,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:37,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408141571] [2022-04-28 06:34:37,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408141571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:37,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:37,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:34:37,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989785763] [2022-04-28 06:34:37,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:37,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 06:34:37,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:37,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:37,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:37,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:34:37,937 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,112 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 06:34:38,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:34:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 06:34:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 06:34:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 06:34:38,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 06:34:38,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,157 INFO L225 Difference]: With dead ends: 46 [2022-04-28 06:34:38,157 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 06:34:38,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:34:38,158 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:38,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:34:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 06:34:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 06:34:38,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:38,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,166 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,166 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,168 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 06:34:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:34:38,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:38,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:38,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 06:34:38,169 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 06:34:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,170 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 06:34:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:34:38,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:38,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:38,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:38,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 06:34:38,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 06:34:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:38,173 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 06:34:38,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:34:38,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 06:34:38,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:34:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 06:34:38,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:38,201 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:38,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 06:34:38,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-28 06:34:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:38,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676760361] [2022-04-28 06:34:38,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-28 06:34:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710645192] [2022-04-28 06:34:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:38,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:34:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:38,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 06:34:38,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:34:38,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 06:34:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 06:34:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:38,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 06:34:38,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 06:34:38,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:34:38,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:34:38,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:34:38,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 06:34:38,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:34:38,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 06:34:38,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-28 06:34:38,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:34:38,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:34:38,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 20);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:34:38,282 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-28 06:34:38,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 06:34:38,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 06:34:38,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:34:38,283 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:34:38,284 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:34:38,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:34:38,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-28 06:34:38,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 06:34:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:34:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710645192] [2022-04-28 06:34:38,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710645192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:34:38,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676760361] [2022-04-28 06:34:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676760361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:34:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015845065] [2022-04-28 06:34:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:38,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 06:34:38,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:38,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:34:38,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:34:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:34:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:34:38,298 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:34:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,538 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-28 06:34:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:34:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 06:34:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:34:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:34:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:34:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:34:38,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 06:34:38,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,588 INFO L225 Difference]: With dead ends: 46 [2022-04-28 06:34:38,588 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 06:34:38,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:34:38,592 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:38,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:34:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 06:34:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-28 06:34:38,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:38,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,608 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,610 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,614 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 06:34:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 06:34:38,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:38,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:38,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 06:34:38,616 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 06:34:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:38,620 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 06:34:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 06:34:38,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:38,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:38,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:38,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:34:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 06:34:38,625 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-28 06:34:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:38,625 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 06:34:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:34:38,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 06:34:38,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 06:34:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 06:34:38,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:38,657 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 06:34:38,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-28 06:34:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683437964] [2022-04-28 06:34:38,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-28 06:34:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784717297] [2022-04-28 06:34:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:38,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:38,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927356212] [2022-04-28 06:34:38,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:38,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:38,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 06:34:38,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:38,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:38,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:34:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:38,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:38,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-28 06:34:38,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-28 06:34:38,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:34:38,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-28 06:34:38,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-28 06:34:38,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:38,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:38,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:38,945 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 06:34:38,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 06:34:38,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 06:34:38,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:34:38,946 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:38,947 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 06:34:38,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 06:34:38,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 06:34:38,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:34:38,948 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:38,949 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:34:38,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:34:38,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-28 06:34:38,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-28 06:34:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:34:38,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:34:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784717297] [2022-04-28 06:34:38,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927356212] [2022-04-28 06:34:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927356212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:38,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:38,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:38,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683437964] [2022-04-28 06:34:38,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683437964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:38,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576588145] [2022-04-28 06:34:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 06:34:38,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:38,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:34:38,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:38,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:34:38,971 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:34:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,123 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 06:34:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:34:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 06:34:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:34:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 06:34:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:34:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 06:34:39,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-28 06:34:39,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:39,188 INFO L225 Difference]: With dead ends: 65 [2022-04-28 06:34:39,188 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 06:34:39,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:34:39,189 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:39,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 06:34:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 06:34:39,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:39,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,207 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,208 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,209 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:34:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:34:39,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:39,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:39,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 06:34:39,211 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 06:34:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,213 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:34:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:34:39,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:39,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:39,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:39,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 06:34:39,216 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-28 06:34:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:39,216 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 06:34:39,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:34:39,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 06:34:39,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:34:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 06:34:39,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:39,259 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:39,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:34:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:39,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-28 06:34:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:39,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390523570] [2022-04-28 06:34:39,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-28 06:34:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:39,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602205196] [2022-04-28 06:34:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:39,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862258315] [2022-04-28 06:34:39,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:39,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:39,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:39,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 06:34:39,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:39,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:39,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:34:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:39,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:39,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-28 06:34:39,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:39,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:39,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:39,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:39,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:39,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,705 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,709 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,709 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,710 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:39,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-28 06:34:39,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1411#false} is VALID [2022-04-28 06:34:39,715 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-28 06:34:39,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-28 06:34:39,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-28 06:34:39,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-28 06:34:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:34:39,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:34:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:39,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602205196] [2022-04-28 06:34:39,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:39,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862258315] [2022-04-28 06:34:39,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862258315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:39,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:39,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:39,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:39,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390523570] [2022-04-28 06:34:39,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390523570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:39,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:39,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733218381] [2022-04-28 06:34:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:39,717 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:34:39,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:39,717 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:39,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:39,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:34:39,736 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,822 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-28 06:34:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:34:39,822 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:34:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:39,822 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:34:39,823 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:34:39,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 06:34:39,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:39,862 INFO L225 Difference]: With dead ends: 70 [2022-04-28 06:34:39,863 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 06:34:39,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:34:39,863 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:39,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 06:34:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 06:34:39,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:39,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,886 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,886 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,888 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 06:34:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 06:34:39,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:39,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:39,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 06:34:39,889 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 06:34:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:39,891 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 06:34:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 06:34:39,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:39,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:39,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:39,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:34:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-28 06:34:39,896 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-28 06:34:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:39,896 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-28 06:34:39,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:39,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-28 06:34:39,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-28 06:34:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 06:34:39,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:39,960 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:39,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 06:34:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 06:34:40,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-28 06:34:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:40,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310439256] [2022-04-28 06:34:40,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:34:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-28 06:34:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150026865] [2022-04-28 06:34:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:40,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:40,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665644876] [2022-04-28 06:34:40,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:40,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:40,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:34:40,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:40,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:40,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:34:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:40,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:42,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-28 06:34:42,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-28 06:34:42,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:34:42,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-28 06:34:42,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-28 06:34:42,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,218 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:34:42,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:34:42,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:34:42,220 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,220 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:34:42,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:34:42,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:34:42,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:34:42,221 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:34:42,223 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:34:42,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:34:42,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-28 06:34:42,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-28 06:34:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:34:42,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:34:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150026865] [2022-04-28 06:34:42,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665644876] [2022-04-28 06:34:42,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665644876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:42,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:42,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:42,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310439256] [2022-04-28 06:34:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310439256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:42,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:42,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721490242] [2022-04-28 06:34:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:42,225 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:34:42,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:42,225 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:42,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:42,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:34:42,243 INFO L87 Difference]: Start difference. First operand 62 states and 72 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:42,429 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 06:34:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:34:42,430 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:34:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:42,430 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 06:34:42,431 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 06:34:42,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 06:34:42,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:42,471 INFO L225 Difference]: With dead ends: 76 [2022-04-28 06:34:42,471 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 06:34:42,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:34:42,472 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:42,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 06:34:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 06:34:42,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:42,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:42,519 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:42,519 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:42,523 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 06:34:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 06:34:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:42,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:42,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 06:34:42,523 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 06:34:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:42,525 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 06:34:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 06:34:42,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:42,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:42,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:42,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-28 06:34:42,529 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-28 06:34:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:42,530 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-28 06:34:42,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:42,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-28 06:34:42,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 06:34:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 06:34:42,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:42,587 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 06:34:42,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:34:42,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:42,803 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-28 06:34:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:42,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575298158] [2022-04-28 06:34:45,245 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:34:45,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:34:45,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:34:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-28 06:34:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:45,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557773193] [2022-04-28 06:34:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:45,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:45,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192583986] [2022-04-28 06:34:45,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:45,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:45,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:45,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:34:45,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:45,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:45,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:34:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:45,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:45,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 06:34:45,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:45,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:45,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:45,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:45,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:45,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,449 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,451 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,451 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,452 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,452 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,454 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:45,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-28 06:34:45,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 20);havoc #t~post6; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 06:34:45,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 06:34:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 06:34:45,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:34:45,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:34:45,626 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 20);havoc #t~post6; {2397#false} is VALID [2022-04-28 06:34:45,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 06:34:45,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2397#false} is VALID [2022-04-28 06:34:45,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:34:45,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,631 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #82#return; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #80#return; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:34:45,632 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:34:45,633 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #78#return; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:34:45,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:34:45,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:34:45,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:34:45,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 20)} is VALID [2022-04-28 06:34:45,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2604#(< ~counter~0 19)} is VALID [2022-04-28 06:34:45,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 19)} call #t~ret7 := main(); {2604#(< ~counter~0 19)} is VALID [2022-04-28 06:34:45,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 19)} {2396#true} #92#return; {2604#(< ~counter~0 19)} is VALID [2022-04-28 06:34:45,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 19)} assume true; {2604#(< ~counter~0 19)} is VALID [2022-04-28 06:34:45,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2604#(< ~counter~0 19)} is VALID [2022-04-28 06:34:45,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 06:34:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 06:34:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:45,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557773193] [2022-04-28 06:34:45,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:45,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192583986] [2022-04-28 06:34:45,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192583986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:34:45,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:34:45,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:34:45,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:45,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575298158] [2022-04-28 06:34:45,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575298158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:45,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:45,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475627257] [2022-04-28 06:34:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:45,639 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 06:34:45,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:45,639 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:34:45,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:34:45,658 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:34:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:45,775 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 06:34:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:34:45,775 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 06:34:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:45,776 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:34:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 06:34:45,777 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:34:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 06:34:45,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 06:34:45,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:45,820 INFO L225 Difference]: With dead ends: 90 [2022-04-28 06:34:45,820 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 06:34:45,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:34:45,820 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:45,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 06:34:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 06:34:45,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:45,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:45,852 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:45,852 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:45,854 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 06:34:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:34:45,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:45,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:45,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 06:34:45,855 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 06:34:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:45,857 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 06:34:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:34:45,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:45,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:45,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:45,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:34:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-28 06:34:45,859 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-28 06:34:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:45,859 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-28 06:34:45,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:34:45,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-28 06:34:45,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:34:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 06:34:45,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:45,922 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:45,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 06:34:46,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:46,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-28 06:34:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:46,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569207184] [2022-04-28 06:34:48,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:34:48,776 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:34:48,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:34:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-28 06:34:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958117195] [2022-04-28 06:34:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:48,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18160208] [2022-04-28 06:34:48,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:48,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:48,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:34:48,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:48,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:48,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:34:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:48,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:49,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 06:34:49,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 06:34:49,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 06:34:49,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 06:34:49,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,027 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,027 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,027 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,028 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,029 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:34:49,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:34:49,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:34:49,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:34:49,030 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,031 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:34:49,031 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,032 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:34:49,032 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:34:49,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:34:49,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 06:34:49,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 06:34:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:34:49,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:34:49,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 06:34:49,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 06:34:49,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:34:49,207 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:34:49,207 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,208 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,208 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,209 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 20);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,212 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,213 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,213 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,214 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,214 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:34:49,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:34:49,215 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:34:49,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 20);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:34:49,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 06:34:49,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 06:34:49,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:34:49,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 06:34:49,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 06:34:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 06:34:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:49,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958117195] [2022-04-28 06:34:49,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:49,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18160208] [2022-04-28 06:34:49,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18160208] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 06:34:49,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:34:49,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 06:34:49,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:49,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569207184] [2022-04-28 06:34:49,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569207184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:49,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:49,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:34:49,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596116409] [2022-04-28 06:34:49,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 06:34:49,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:49,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:49,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:49,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:34:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:34:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 06:34:49,238 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:51,478 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 06:34:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:34:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 06:34:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 06:34:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 06:34:51,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 06:34:51,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:51,528 INFO L225 Difference]: With dead ends: 78 [2022-04-28 06:34:51,528 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 06:34:51,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:34:51,529 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:51,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:34:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 06:34:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-28 06:34:51,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:51,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:34:51,574 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:34:51,575 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:34:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:51,577 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 06:34:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 06:34:51,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:51,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:51,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 06:34:51,578 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 06:34:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:51,580 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 06:34:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 06:34:51,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:51,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:51,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:51,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:34:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 06:34:51,583 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-28 06:34:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:51,584 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 06:34:51,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:34:51,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-28 06:34:51,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 06:34:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 06:34:51,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:51,661 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:51,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 06:34:51,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:51,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-28 06:34:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:51,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1850319333] [2022-04-28 06:34:55,999 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:34:55,999 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:34:55,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:34:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-28 06:34:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:34:55,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183302961] [2022-04-28 06:34:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:34:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:34:56,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:34:56,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428315370] [2022-04-28 06:34:56,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:34:56,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:34:56,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:34:56,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 06:34:56,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:34:56,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:34:56,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:34:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:34:56,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:34:56,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 06:34:56,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:56,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:56,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:56,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:56,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:34:56,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,282 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,282 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,284 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,284 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,285 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:34:56,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,294 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,295 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,295 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,300 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,301 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,302 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:34:56,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 06:34:56,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 06:34:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 06:34:56,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:34:56,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 06:34:56,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 06:34:56,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:34:56,545 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:34:56,545 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 06:34:56,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,545 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3770#false} is VALID [2022-04-28 06:34:56,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:34:56,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 20)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,547 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #82#return; {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,549 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,553 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #80#return; {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #78#return; {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,554 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 20)} is VALID [2022-04-28 06:34:56,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,556 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #82#return; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,556 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #80#return; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #78#return; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:34:56,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:34:56,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:34:56,558 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:34:56,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 19)} is VALID [2022-04-28 06:34:56,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4075#(< ~counter~0 18)} is VALID [2022-04-28 06:34:56,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 18)} call #t~ret7 := main(); {4075#(< ~counter~0 18)} is VALID [2022-04-28 06:34:56,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 18)} {3769#true} #92#return; {4075#(< ~counter~0 18)} is VALID [2022-04-28 06:34:56,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 18)} assume true; {4075#(< ~counter~0 18)} is VALID [2022-04-28 06:34:56,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4075#(< ~counter~0 18)} is VALID [2022-04-28 06:34:56,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 06:34:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 06:34:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:34:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183302961] [2022-04-28 06:34:56,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:34:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428315370] [2022-04-28 06:34:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428315370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:34:56,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:34:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 06:34:56,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:34:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1850319333] [2022-04-28 06:34:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1850319333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:34:56,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:34:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:34:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085973167] [2022-04-28 06:34:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:34:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 06:34:56,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:34:56,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:34:56,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:56,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:34:56,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:34:56,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:34:56,588 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:34:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:56,782 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 06:34:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:34:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 06:34:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:34:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:34:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 06:34:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:34:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 06:34:56,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-28 06:34:56,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:56,842 INFO L225 Difference]: With dead ends: 104 [2022-04-28 06:34:56,842 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 06:34:56,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:34:56,842 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:34:56,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:34:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 06:34:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 06:34:56,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:34:56,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:34:56,900 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:34:56,900 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:34:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:56,902 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 06:34:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 06:34:56,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:56,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:56,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 06:34:56,902 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 06:34:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:34:56,904 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 06:34:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 06:34:56,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:34:56,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:34:56,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:34:56,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:34:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:34:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-28 06:34:56,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-28 06:34:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:34:56,906 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-28 06:34:56,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:34:56,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-28 06:34:56,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:34:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-28 06:34:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 06:34:56,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:34:56,996 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:34:57,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 06:34:57,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:34:57,203 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:34:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:34:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-28 06:34:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:34:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146928470] [2022-04-28 06:35:01,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:35:01,295 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:35:01,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:35:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-28 06:35:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:35:01,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443317508] [2022-04-28 06:35:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:35:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:35:01,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:35:01,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63223042] [2022-04-28 06:35:01,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:35:01,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:35:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:35:01,304 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:35:01,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 06:35:01,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:35:01,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:35:01,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:35:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:35:01,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:35:01,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 06:35:01,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:01,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:01,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:01,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:01,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {4678#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:01,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {4678#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,550 INFO L272 TraceCheckUtils]: 8: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,551 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,551 INFO L272 TraceCheckUtils]: 13: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,553 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,553 INFO L272 TraceCheckUtils]: 18: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4694#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:01,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {4694#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,556 INFO L272 TraceCheckUtils]: 26: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,557 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,557 INFO L272 TraceCheckUtils]: 31: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,558 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,559 INFO L272 TraceCheckUtils]: 36: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,560 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4804#(<= |main_#t~post5| 2)} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 20);havoc #t~post6; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 06:35:01,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 06:35:01,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 06:35:01,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 06:35:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 06:35:01,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:35:01,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 06:35:01,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 06:35:01,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 06:35:01,809 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 06:35:01,810 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,810 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 20);havoc #t~post6; {4671#false} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4671#false} is VALID [2022-04-28 06:35:01,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4874#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:35:01,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,811 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #82#return; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,811 INFO L272 TraceCheckUtils]: 36: Hoare triple {4878#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,812 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #80#return; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,812 INFO L272 TraceCheckUtils]: 31: Hoare triple {4878#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,812 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #78#return; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,813 INFO L272 TraceCheckUtils]: 26: Hoare triple {4878#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {4878#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4878#(< ~counter~0 20)} is VALID [2022-04-28 06:35:01,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {4933#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,814 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #82#return; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,816 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #80#return; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,816 INFO L272 TraceCheckUtils]: 13: Hoare triple {4933#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,817 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #78#return; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 06:35:01,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 06:35:01,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 06:35:01,817 INFO L272 TraceCheckUtils]: 8: Hoare triple {4933#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 06:35:01,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {4933#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(< ~counter~0 19)} is VALID [2022-04-28 06:35:01,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4988#(< ~counter~0 18)} is VALID [2022-04-28 06:35:01,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 18)} call #t~ret7 := main(); {4988#(< ~counter~0 18)} is VALID [2022-04-28 06:35:01,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 18)} {4670#true} #92#return; {4988#(< ~counter~0 18)} is VALID [2022-04-28 06:35:01,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 18)} assume true; {4988#(< ~counter~0 18)} is VALID [2022-04-28 06:35:01,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4988#(< ~counter~0 18)} is VALID [2022-04-28 06:35:01,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 06:35:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 06:35:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:35:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443317508] [2022-04-28 06:35:01,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:35:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63223042] [2022-04-28 06:35:01,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63223042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:35:01,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:35:01,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 06:35:01,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:35:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146928470] [2022-04-28 06:35:01,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146928470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:35:01,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:35:01,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:35:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105811374] [2022-04-28 06:35:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:35:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 06:35:01,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:35:01,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:35:01,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:01,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:35:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:35:01,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:35:01,849 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:35:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:02,026 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-28 06:35:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:35:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 06:35:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:35:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:35:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 06:35:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:35:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 06:35:02,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 06:35:02,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:02,088 INFO L225 Difference]: With dead ends: 126 [2022-04-28 06:35:02,088 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 06:35:02,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:35:02,089 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:35:02,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:35:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 06:35:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 06:35:02,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:35:02,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:35:02,139 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:35:02,139 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:35:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:02,141 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 06:35:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:35:02,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:02,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:02,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 06:35:02,142 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 06:35:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:02,143 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 06:35:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:35:02,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:02,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:02,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:35:02,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:35:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:35:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-28 06:35:02,145 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-28 06:35:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:35:02,146 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-28 06:35:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:35:02,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-28 06:35:02,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:35:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 06:35:02,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:35:02,268 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:35:02,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 06:35:02,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:35:02,473 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:35:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:35:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-28 06:35:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403569342] [2022-04-28 06:35:04,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:35:04,963 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:35:04,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:35:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-28 06:35:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:35:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906008628] [2022-04-28 06:35:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:35:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:35:04,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:35:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705939136] [2022-04-28 06:35:04,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:35:04,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:35:04,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:35:04,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:35:04,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 06:35:05,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:35:05,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:35:05,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 06:35:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:35:05,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:35:05,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 06:35:05,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:05,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:05,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:05,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:05,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {5645#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 06:35:05,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,307 INFO L272 TraceCheckUtils]: 8: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,309 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,310 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,312 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 06:35:05,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,313 INFO L272 TraceCheckUtils]: 26: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,314 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,315 INFO L272 TraceCheckUtils]: 31: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,316 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,316 INFO L272 TraceCheckUtils]: 36: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,317 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 06:35:05,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {5716#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {5771#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,319 INFO L272 TraceCheckUtils]: 44: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,322 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,323 INFO L272 TraceCheckUtils]: 49: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,324 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {5771#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {5771#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 06:35:05,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {5771#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5814#(<= |main_#t~post6| 3)} is VALID [2022-04-28 06:35:05,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {5638#false} is VALID [2022-04-28 06:35:05,326 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 06:35:05,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 06:35:05,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 06:35:05,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 06:35:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 06:35:05,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:35:05,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 06:35:05,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 06:35:05,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 06:35:05,610 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 06:35:05,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5638#false} is VALID [2022-04-28 06:35:05,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {5846#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5842#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:35:05,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {5846#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {5846#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,612 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 20)} #86#return; {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,612 INFO L272 TraceCheckUtils]: 49: Hoare triple {5846#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,612 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 20)} #84#return; {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,613 INFO L272 TraceCheckUtils]: 44: Hoare triple {5846#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 20)} is VALID [2022-04-28 06:35:05,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 19)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,614 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #82#return; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,614 INFO L272 TraceCheckUtils]: 36: Hoare triple {5889#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,615 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #80#return; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,615 INFO L272 TraceCheckUtils]: 31: Hoare triple {5889#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,615 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #78#return; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,616 INFO L272 TraceCheckUtils]: 26: Hoare triple {5889#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {5889#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:35:05,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,617 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #82#return; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,617 INFO L272 TraceCheckUtils]: 18: Hoare triple {5944#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #80#return; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {5944#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #78#return; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 06:35:05,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 06:35:05,619 INFO L272 TraceCheckUtils]: 8: Hoare triple {5944#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 06:35:05,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {5944#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {5999#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5944#(< ~counter~0 18)} is VALID [2022-04-28 06:35:05,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {5999#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5999#(< ~counter~0 17)} is VALID [2022-04-28 06:35:05,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 17)} call #t~ret7 := main(); {5999#(< ~counter~0 17)} is VALID [2022-04-28 06:35:05,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 17)} {5637#true} #92#return; {5999#(< ~counter~0 17)} is VALID [2022-04-28 06:35:05,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 17)} assume true; {5999#(< ~counter~0 17)} is VALID [2022-04-28 06:35:05,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5999#(< ~counter~0 17)} is VALID [2022-04-28 06:35:05,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 06:35:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:35:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:35:05,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906008628] [2022-04-28 06:35:05,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:35:05,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705939136] [2022-04-28 06:35:05,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705939136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:35:05,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:35:05,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 06:35:05,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:35:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403569342] [2022-04-28 06:35:05,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403569342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:35:05,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:35:05,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:35:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035197741] [2022-04-28 06:35:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:35:05,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 06:35:05,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:35:05,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:35:05,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:35:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:35:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:35:05,656 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:35:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:06,015 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-28 06:35:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:35:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 06:35:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:35:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:35:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 06:35:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:35:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 06:35:06,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 06:35:06,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:06,096 INFO L225 Difference]: With dead ends: 145 [2022-04-28 06:35:06,097 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 06:35:06,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:35:06,097 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:35:06,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:35:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 06:35:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 06:35:06,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:35:06,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:35:06,171 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:35:06,171 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:35:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:06,174 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 06:35:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 06:35:06,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:06,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:06,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 06:35:06,174 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 06:35:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:06,177 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 06:35:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 06:35:06,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:06,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:06,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:35:06,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:35:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:35:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-28 06:35:06,179 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-28 06:35:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:35:06,180 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-28 06:35:06,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:35:06,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-28 06:35:06,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-28 06:35:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 06:35:06,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:35:06,305 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:35:06,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 06:35:06,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 06:35:06,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:35:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:35:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-28 06:35:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229241427] [2022-04-28 06:35:10,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:35:10,706 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:35:10,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:35:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-28 06:35:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:35:10,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621596553] [2022-04-28 06:35:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:35:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:35:10,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:35:10,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700499429] [2022-04-28 06:35:10,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:35:10,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:35:10,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:35:10,720 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:35:10,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 06:35:10,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:35:10,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:35:10,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 06:35:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:35:10,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:35:11,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 06:35:11,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 06:35:11,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 06:35:11,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 06:35:11,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,238 INFO L272 TraceCheckUtils]: 8: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,239 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,239 INFO L272 TraceCheckUtils]: 13: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,240 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,240 INFO L272 TraceCheckUtils]: 18: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,241 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,243 INFO L272 TraceCheckUtils]: 26: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,243 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,244 INFO L272 TraceCheckUtils]: 31: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,244 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,244 INFO L272 TraceCheckUtils]: 36: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,245 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,247 INFO L272 TraceCheckUtils]: 44: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,247 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,247 INFO L272 TraceCheckUtils]: 49: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:11,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:11,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:11,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:11,248 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:35:11,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:35:11,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:35:11,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:35:11,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:35:11,250 INFO L272 TraceCheckUtils]: 58: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:35:11,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:11,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 06:35:11,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 06:35:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:35:11,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:35:12,315 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 06:35:12,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 06:35:12,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:12,316 INFO L272 TraceCheckUtils]: 58: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:35:12,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 20);havoc #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:35:12,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:35:12,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:35:12,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,348 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L272 TraceCheckUtils]: 49: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,349 INFO L272 TraceCheckUtils]: 44: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 20);havoc #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,353 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,353 INFO L272 TraceCheckUtils]: 36: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,354 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,354 INFO L272 TraceCheckUtils]: 31: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,354 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,355 INFO L272 TraceCheckUtils]: 26: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 20);havoc #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:35:12,364 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,364 INFO L272 TraceCheckUtils]: 18: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,364 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 06:35:12,365 INFO L272 TraceCheckUtils]: 8: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 06:35:12,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:35:12,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 06:35:12,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 06:35:12,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 06:35:12,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 06:35:12,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 06:35:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:35:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:35:12,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621596553] [2022-04-28 06:35:12,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:35:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700499429] [2022-04-28 06:35:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700499429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:35:12,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:35:12,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 06:35:12,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:35:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229241427] [2022-04-28 06:35:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229241427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:35:12,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:35:12,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:35:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425179959] [2022-04-28 06:35:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:35:12,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 06:35:12,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:35:12,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:35:12,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:12,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:35:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:35:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:35:12,403 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:35:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:13,006 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-28 06:35:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 06:35:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 06:35:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:35:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:35:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 06:35:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:35:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 06:35:13,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-28 06:35:13,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:13,100 INFO L225 Difference]: With dead ends: 181 [2022-04-28 06:35:13,100 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 06:35:13,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:35:13,101 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:35:13,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:35:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 06:35:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 06:35:13,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:35:13,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:35:13,202 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:35:13,202 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:35:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:13,204 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 06:35:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 06:35:13,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:13,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:13,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 06:35:13,205 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 06:35:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:13,207 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 06:35:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 06:35:13,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:13,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:13,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:35:13,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:35:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:35:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-28 06:35:13,210 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-28 06:35:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:35:13,210 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-28 06:35:13,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:35:13,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-28 06:35:13,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-28 06:35:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 06:35:13,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:35:13,346 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:35:13,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 06:35:13,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 06:35:13,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:35:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:35:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-28 06:35:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:13,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2122305245] [2022-04-28 06:35:17,657 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:35:17,657 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:35:17,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:35:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-28 06:35:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:35:17,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949634080] [2022-04-28 06:35:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:35:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:35:17,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:35:17,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699888412] [2022-04-28 06:35:17,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:35:17,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:35:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:35:17,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:35:17,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 06:35:17,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:35:17,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:35:17,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 06:35:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:35:17,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:35:19,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {8115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {8115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 20);havoc #t~post5; {8115#true} is VALID [2022-04-28 06:35:19,710 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L272 TraceCheckUtils]: 13: Hoare triple {8115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:19,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8115#true} #80#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:35:19,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {8173#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8115#true} {8173#(= main_~A~0 main_~r~0)} #82#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:35:19,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {8173#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 06:35:19,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 06:35:19,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 06:35:19,714 INFO L272 TraceCheckUtils]: 26: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:19,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,715 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #78#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,716 INFO L272 TraceCheckUtils]: 31: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,716 INFO L272 TraceCheckUtils]: 36: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,717 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,718 INFO L272 TraceCheckUtils]: 44: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,719 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,719 INFO L272 TraceCheckUtils]: 49: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 06:35:19,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 06:35:19,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 06:35:19,719 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} is VALID [2022-04-28 06:35:19,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:35:19,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:35:19,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:35:19,722 INFO L272 TraceCheckUtils]: 58: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 06:35:19,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:19,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:35:19,731 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} is VALID [2022-04-28 06:35:19,732 INFO L272 TraceCheckUtils]: 63: Hoare triple {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:35:19,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:35:19,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-28 06:35:19,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-28 06:35:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-28 06:35:19,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:35:36,953 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:35:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:35:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949634080] [2022-04-28 06:35:54,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:35:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699888412] [2022-04-28 06:35:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699888412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 06:35:54,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:35:54,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 06:35:54,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:35:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2122305245] [2022-04-28 06:35:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2122305245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:35:54,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:35:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:35:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526787537] [2022-04-28 06:35:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:35:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 06:35:54,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:35:54,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 06:35:54,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:54,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:35:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:35:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-28 06:35:54,139 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 06:35:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:55,317 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-28 06:35:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 06:35:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 06:35:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:35:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 06:35:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 06:35:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 06:35:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 06:35:55,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-28 06:35:55,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:55,441 INFO L225 Difference]: With dead ends: 188 [2022-04-28 06:35:55,441 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 06:35:55,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:35:55,441 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 06:35:55,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-04-28 06:35:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 06:35:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 06:35:55,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:35:55,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:35:55,570 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:35:55,570 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:35:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:55,573 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 06:35:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 06:35:55,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:55,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:55,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 06:35:55,574 INFO L87 Difference]: Start difference. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 06:35:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:35:55,577 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 06:35:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 06:35:55,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:35:55,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:35:55,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:35:55,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:35:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:35:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-28 06:35:55,581 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-28 06:35:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:35:55,581 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-28 06:35:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 06:35:55,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-28 06:35:55,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:35:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-28 06:35:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 06:35:55,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:35:55,782 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:35:55,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 06:35:55,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 06:35:55,983 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:35:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:35:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-28 06:35:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:35:55,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772504523] [2022-04-28 06:36:00,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:00,083 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:00,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-28 06:36:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:00,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968610581] [2022-04-28 06:36:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:00,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:00,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763002933] [2022-04-28 06:36:00,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:00,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:00,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:00,117 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:00,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 06:36:00,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:00,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:00,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:36:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:00,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 06:36:00,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 06:36:00,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 06:36:00,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 06:36:00,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,766 INFO L272 TraceCheckUtils]: 8: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,766 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:00,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,768 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,768 INFO L272 TraceCheckUtils]: 18: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,768 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,769 INFO L272 TraceCheckUtils]: 26: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,770 INFO L272 TraceCheckUtils]: 31: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,771 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,771 INFO L272 TraceCheckUtils]: 36: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,772 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,773 INFO L272 TraceCheckUtils]: 44: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,773 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,773 INFO L272 TraceCheckUtils]: 49: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:00,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:00,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:00,774 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:00,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,776 INFO L272 TraceCheckUtils]: 58: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:00,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,777 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,777 INFO L272 TraceCheckUtils]: 63: Hoare triple {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:00,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:00,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,778 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:00,779 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:00,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-28 06:36:00,780 INFO L272 TraceCheckUtils]: 69: Hoare triple {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:00,780 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:00,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 06:36:00,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 06:36:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 06:36:00,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:11,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 06:36:11,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 06:36:11,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:11,386 INFO L272 TraceCheckUtils]: 69: Hoare triple {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:11,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:36:11,387 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #86#return; {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 06:36:11,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:11,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:11,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:36:11,388 INFO L272 TraceCheckUtils]: 63: Hoare triple {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,390 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9367#true} #84#return; {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 06:36:11,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:11,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:11,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:36:11,391 INFO L272 TraceCheckUtils]: 58: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 20);havoc #t~post6; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {9367#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {9367#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L272 TraceCheckUtils]: 49: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L272 TraceCheckUtils]: 44: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 20);havoc #t~post6; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L272 TraceCheckUtils]: 36: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L272 TraceCheckUtils]: 31: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L272 TraceCheckUtils]: 26: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 20);havoc #t~post5; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {9367#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L272 TraceCheckUtils]: 18: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L272 TraceCheckUtils]: 13: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L272 TraceCheckUtils]: 8: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 20);havoc #t~post5; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 06:36:11,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 06:36:11,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 06:36:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-28 06:36:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968610581] [2022-04-28 06:36:11,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763002933] [2022-04-28 06:36:11,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763002933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:11,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:11,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-28 06:36:11,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772504523] [2022-04-28 06:36:11,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772504523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:11,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:11,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 06:36:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549095286] [2022-04-28 06:36:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:11,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 06:36:11,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:11,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:11,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:11,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 06:36:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:11,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 06:36:11,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:36:11,441 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:12,414 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-28 06:36:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 06:36:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 06:36:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 06:36:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 06:36:12,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 06:36:12,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:12,500 INFO L225 Difference]: With dead ends: 186 [2022-04-28 06:36:12,501 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 06:36:12,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:36:12,501 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:12,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 06:36:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 06:36:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-28 06:36:12,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:12,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:12,603 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:12,603 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:12,606 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 06:36:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 06:36:12,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:12,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:12,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 06:36:12,606 INFO L87 Difference]: Start difference. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 06:36:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:12,608 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 06:36:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 06:36:12,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:12,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:12,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:12,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-28 06:36:12,611 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-28 06:36:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:12,611 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-28 06:36:12,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:12,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-28 06:36:12,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 06:36:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 06:36:12,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:12,768 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:12,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:12,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 06:36:12,969 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-28 06:36:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:12,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [514662974] [2022-04-28 06:36:15,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:15,177 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:15,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-28 06:36:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710824231] [2022-04-28 06:36:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:15,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226557525] [2022-04-28 06:36:15,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:36:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:15,191 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:15,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 06:36:15,242 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 06:36:15,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:15,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 06:36:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:15,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:15,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 06:36:15,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:15,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:15,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:15,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:15,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {10720#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:15,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {10720#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,518 INFO L272 TraceCheckUtils]: 8: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,520 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,520 INFO L272 TraceCheckUtils]: 13: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,521 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,521 INFO L272 TraceCheckUtils]: 18: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,523 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {10736#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:15,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {10736#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {10791#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,524 INFO L272 TraceCheckUtils]: 26: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,525 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,525 INFO L272 TraceCheckUtils]: 31: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,527 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,527 INFO L272 TraceCheckUtils]: 36: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,529 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {10791#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:15,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {10791#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {10846#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,530 INFO L272 TraceCheckUtils]: 44: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,535 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,536 INFO L272 TraceCheckUtils]: 49: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,537 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,537 INFO L272 TraceCheckUtils]: 54: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,538 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,538 INFO L290 TraceCheckUtils]: 59: Hoare triple {10846#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {10846#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10901#(<= |main_#t~post5| 3)} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 20);havoc #t~post6; {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-28 06:36:15,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 06:36:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 06:36:15,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:15,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 06:36:15,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 06:36:15,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 06:36:15,800 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 06:36:15,801 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,801 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 20);havoc #t~post6; {10713#false} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10713#false} is VALID [2022-04-28 06:36:15,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {10975#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10971#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:36:15,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {10975#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,802 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #82#return; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,802 INFO L272 TraceCheckUtils]: 54: Hoare triple {10975#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #80#return; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L272 TraceCheckUtils]: 49: Hoare triple {10975#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #78#return; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,804 INFO L272 TraceCheckUtils]: 44: Hoare triple {10975#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {11030#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(< ~counter~0 20)} is VALID [2022-04-28 06:36:15,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,805 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #82#return; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,805 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #80#return; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L272 TraceCheckUtils]: 31: Hoare triple {11030#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #78#return; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,807 INFO L272 TraceCheckUtils]: 26: Hoare triple {11030#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {11030#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {11085#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(< ~counter~0 19)} is VALID [2022-04-28 06:36:15,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {11085#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,808 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #82#return; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,808 INFO L272 TraceCheckUtils]: 18: Hoare triple {11085#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #80#return; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L272 TraceCheckUtils]: 13: Hoare triple {11085#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #78#return; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 06:36:15,809 INFO L272 TraceCheckUtils]: 8: Hoare triple {11085#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 06:36:15,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(< ~counter~0 18)} is VALID [2022-04-28 06:36:15,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {11140#(< ~counter~0 17)} is VALID [2022-04-28 06:36:15,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 17)} call #t~ret7 := main(); {11140#(< ~counter~0 17)} is VALID [2022-04-28 06:36:15,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 17)} {10712#true} #92#return; {11140#(< ~counter~0 17)} is VALID [2022-04-28 06:36:15,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 17)} assume true; {11140#(< ~counter~0 17)} is VALID [2022-04-28 06:36:15,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11140#(< ~counter~0 17)} is VALID [2022-04-28 06:36:15,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 06:36:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 06:36:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710824231] [2022-04-28 06:36:15,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226557525] [2022-04-28 06:36:15,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226557525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:15,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:15,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 06:36:15,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [514662974] [2022-04-28 06:36:15,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [514662974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:15,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:15,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:36:15,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068973252] [2022-04-28 06:36:15,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 06:36:15,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:15,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:15,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:36:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:36:15,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:36:15,852 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:16,104 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-28 06:36:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 06:36:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 06:36:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 06:36:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 06:36:16,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-28 06:36:16,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:16,172 INFO L225 Difference]: With dead ends: 170 [2022-04-28 06:36:16,173 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 06:36:16,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 06:36:16,173 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 06:36:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 06:36:16,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:16,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:16,270 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:16,270 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:16,272 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 06:36:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 06:36:16,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:16,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:16,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 06:36:16,273 INFO L87 Difference]: Start difference. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 06:36:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:16,276 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 06:36:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 06:36:16,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:16,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:16,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:16,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 06:36:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-28 06:36:16,278 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-28 06:36:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:16,279 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-28 06:36:16,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 06:36:16,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-28 06:36:16,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 06:36:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 06:36:16,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:16,436 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:16,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 06:36:16,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-28 06:36:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539693429] [2022-04-28 06:36:20,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:20,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:20,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-28 06:36:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:20,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82440834] [2022-04-28 06:36:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:20,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:20,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494771861] [2022-04-28 06:36:20,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:36:20,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:20,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:20,021 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:20,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 06:36:20,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:36:20,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:20,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:36:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:20,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:20,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 06:36:20,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:20,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:20,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:20,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:20,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {12039#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:20,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {12039#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {12055#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,387 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,387 INFO L272 TraceCheckUtils]: 13: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,389 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,389 INFO L272 TraceCheckUtils]: 18: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,390 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:20,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,391 INFO L272 TraceCheckUtils]: 26: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,393 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,393 INFO L272 TraceCheckUtils]: 31: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,394 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,394 INFO L272 TraceCheckUtils]: 36: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,395 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {12110#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:20,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {12110#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {12165#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,397 INFO L272 TraceCheckUtils]: 44: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,398 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,399 INFO L272 TraceCheckUtils]: 49: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,400 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,400 INFO L272 TraceCheckUtils]: 54: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,401 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:20,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {12220#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,403 INFO L272 TraceCheckUtils]: 62: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,404 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,405 INFO L272 TraceCheckUtils]: 67: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,405 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,406 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {12220#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {12220#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 06:36:20,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {12220#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12263#(<= |main_#t~post6| 4)} is VALID [2022-04-28 06:36:20,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {12032#false} is VALID [2022-04-28 06:36:20,407 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 06:36:20,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 06:36:20,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 06:36:20,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 06:36:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:36:20,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:20,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 06:36:20,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 06:36:20,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 06:36:20,716 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 06:36:20,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12032#false} is VALID [2022-04-28 06:36:20,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {12295#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12291#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:36:20,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {12295#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {12295#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,718 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 20)} #86#return; {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,718 INFO L272 TraceCheckUtils]: 67: Hoare triple {12295#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,718 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 20)} #84#return; {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,719 INFO L272 TraceCheckUtils]: 62: Hoare triple {12295#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {12295#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {12338#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12295#(< ~counter~0 20)} is VALID [2022-04-28 06:36:20,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 19)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,720 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #82#return; {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L272 TraceCheckUtils]: 54: Hoare triple {12338#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #80#return; {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L272 TraceCheckUtils]: 49: Hoare triple {12338#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,721 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #78#return; {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,722 INFO L272 TraceCheckUtils]: 44: Hoare triple {12338#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {12338#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12338#(< ~counter~0 19)} is VALID [2022-04-28 06:36:20,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,723 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #82#return; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,723 INFO L272 TraceCheckUtils]: 36: Hoare triple {12393#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #80#return; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L272 TraceCheckUtils]: 31: Hoare triple {12393#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #78#return; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,724 INFO L272 TraceCheckUtils]: 26: Hoare triple {12393#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {12448#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12393#(< ~counter~0 18)} is VALID [2022-04-28 06:36:20,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {12448#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,726 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #82#return; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,726 INFO L272 TraceCheckUtils]: 18: Hoare triple {12448#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #80#return; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L272 TraceCheckUtils]: 13: Hoare triple {12448#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #78#return; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L272 TraceCheckUtils]: 8: Hoare triple {12448#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 06:36:20,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {12448#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {12503#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12448#(< ~counter~0 17)} is VALID [2022-04-28 06:36:20,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {12503#(< ~counter~0 16)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12503#(< ~counter~0 16)} is VALID [2022-04-28 06:36:20,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 16)} call #t~ret7 := main(); {12503#(< ~counter~0 16)} is VALID [2022-04-28 06:36:20,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 16)} {12031#true} #92#return; {12503#(< ~counter~0 16)} is VALID [2022-04-28 06:36:20,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 16)} assume true; {12503#(< ~counter~0 16)} is VALID [2022-04-28 06:36:20,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12503#(< ~counter~0 16)} is VALID [2022-04-28 06:36:20,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 06:36:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 06:36:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:20,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82440834] [2022-04-28 06:36:20,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:20,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494771861] [2022-04-28 06:36:20,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494771861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:20,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:20,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 06:36:20,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:20,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539693429] [2022-04-28 06:36:20,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539693429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:20,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:20,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:36:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703654915] [2022-04-28 06:36:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 06:36:20,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:20,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 06:36:20,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:20,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:36:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:36:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 06:36:20,776 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 06:36:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:21,274 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-28 06:36:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 06:36:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 06:36:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 06:36:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 06:36:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 06:36:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 06:36:21,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-28 06:36:21,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:21,370 INFO L225 Difference]: With dead ends: 181 [2022-04-28 06:36:21,370 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 06:36:21,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-28 06:36:21,371 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:21,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 06:36:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-28 06:36:21,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:21,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:36:21,505 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:36:21,505 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:36:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:21,510 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 06:36:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 06:36:21,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:21,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:21,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 06:36:21,511 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 06:36:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:21,514 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 06:36:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 06:36:21,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:21,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:21,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:21,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 06:36:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-28 06:36:21,517 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-28 06:36:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:21,517 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-28 06:36:21,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 06:36:21,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-28 06:36:21,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-28 06:36:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 06:36:21,728 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:21,728 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:21,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:21,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 06:36:21,929 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-28 06:36:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:21,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645973525] [2022-04-28 06:36:24,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:24,076 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:24,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-28 06:36:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:24,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805231255] [2022-04-28 06:36:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:24,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10364171] [2022-04-28 06:36:24,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:36:24,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:24,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:24,086 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:24,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 06:36:24,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 06:36:24,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:24,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 06:36:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:24,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:24,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 06:36:24,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 06:36:24,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 06:36:24,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 06:36:24,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,838 INFO L272 TraceCheckUtils]: 8: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,838 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,839 INFO L272 TraceCheckUtils]: 13: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,839 INFO L272 TraceCheckUtils]: 18: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,840 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,841 INFO L272 TraceCheckUtils]: 26: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,841 INFO L272 TraceCheckUtils]: 31: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,842 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,842 INFO L272 TraceCheckUtils]: 36: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,842 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,844 INFO L272 TraceCheckUtils]: 44: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,845 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #78#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,845 INFO L272 TraceCheckUtils]: 49: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,845 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #80#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,845 INFO L272 TraceCheckUtils]: 54: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:24,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:24,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:24,847 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #82#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,848 INFO L272 TraceCheckUtils]: 62: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,848 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #84#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,848 INFO L272 TraceCheckUtils]: 67: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:36:24,848 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:36:24,849 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:36:24,849 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:36:24,849 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #86#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:24,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:24,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 06:36:24,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 06:36:24,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 06:36:24,852 INFO L272 TraceCheckUtils]: 76: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:24,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:24,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 06:36:24,853 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 06:36:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 06:36:24,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:37:10,576 WARN L232 SmtUtils]: Spent 23.55s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 06:38:35,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 06:38:35,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 06:38:35,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:38:35,312 INFO L272 TraceCheckUtils]: 76: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:38:35,313 INFO L290 TraceCheckUtils]: 75: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 20);havoc #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:38:35,345 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L272 TraceCheckUtils]: 67: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,347 INFO L272 TraceCheckUtils]: 62: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 20);havoc #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,350 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #82#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:38:35,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:38:35,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:38:35,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:38:35,351 INFO L272 TraceCheckUtils]: 54: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,352 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #80#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:38:35,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,352 INFO L272 TraceCheckUtils]: 49: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,353 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #78#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:38:35,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,353 INFO L272 TraceCheckUtils]: 44: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:38:35,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:38:35,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:38:35,361 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,361 INFO L272 TraceCheckUtils]: 36: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,362 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,362 INFO L272 TraceCheckUtils]: 31: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,363 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,363 INFO L272 TraceCheckUtils]: 26: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 20);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,364 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,364 INFO L272 TraceCheckUtils]: 18: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,365 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,366 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 06:38:35,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 06:38:35,366 INFO L272 TraceCheckUtils]: 8: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 06:38:35,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 20);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:38:35,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 06:38:35,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 06:38:35,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 06:38:35,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 06:38:35,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 06:38:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 06:38:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:38:35,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805231255] [2022-04-28 06:38:35,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:38:35,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10364171] [2022-04-28 06:38:35,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10364171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:38:35,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:38:35,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-28 06:38:35,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:38:35,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645973525] [2022-04-28 06:38:35,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645973525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:38:35,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:38:35,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 06:38:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554639033] [2022-04-28 06:38:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:38:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 06:38:35,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:38:35,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:38:35,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:35,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 06:38:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:35,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 06:38:35,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:38:35,410 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:38:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:36,193 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-28 06:38:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 06:38:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 06:38:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:38:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:38:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 06:38:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:38:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 06:38:36,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 06:38:36,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:36,291 INFO L225 Difference]: With dead ends: 193 [2022-04-28 06:38:36,291 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 06:38:36,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:38:36,292 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:38:36,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 06:38:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 06:38:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-28 06:38:36,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:38:36,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 06:38:36,434 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 06:38:36,434 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 06:38:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:36,436 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 06:38:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 06:38:36,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:36,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:36,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 06:38:36,437 INFO L87 Difference]: Start difference. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 06:38:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:36,439 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 06:38:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 06:38:36,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:36,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:36,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:38:36,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:38:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 06:38:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-28 06:38:36,442 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-28 06:38:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:38:36,443 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-28 06:38:36,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:38:36,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-28 06:38:36,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-28 06:38:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 06:38:36,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:38:36,665 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 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] [2022-04-28 06:38:36,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 06:38:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:36,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:38:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:38:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-28 06:38:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:36,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482527172] [2022-04-28 06:38:39,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:38:39,881 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:38:39,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:38:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-28 06:38:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:38:39,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814397950] [2022-04-28 06:38:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:38:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:38:39,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:38:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580172060] [2022-04-28 06:38:39,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:38:39,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:39,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:38:39,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:38:39,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 06:38:39,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:38:39,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:38:39,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 06:38:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:38:39,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:38:42,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 06:38:42,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 20);havoc #t~post5; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,491 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 06:38:42,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post5 < 20);havoc #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,493 INFO L272 TraceCheckUtils]: 26: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #78#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,493 INFO L272 TraceCheckUtils]: 31: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,494 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #80#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,494 INFO L272 TraceCheckUtils]: 36: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,494 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #82#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,496 INFO L272 TraceCheckUtils]: 44: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,497 INFO L272 TraceCheckUtils]: 49: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,498 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,498 INFO L272 TraceCheckUtils]: 54: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,498 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,499 INFO L272 TraceCheckUtils]: 62: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,500 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,500 INFO L272 TraceCheckUtils]: 67: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,501 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #86#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:38:42,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,502 INFO L290 TraceCheckUtils]: 74: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post6 < 20);havoc #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,503 INFO L272 TraceCheckUtils]: 76: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #84#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,503 INFO L272 TraceCheckUtils]: 81: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,503 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,504 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #86#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 06:38:42,504 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 06:38:42,504 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 06:38:42,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 06:38:42,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 06:38:42,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 06:38:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:38:42,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:38:42,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 06:38:42,720 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 06:38:42,720 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 06:38:42,720 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 06:38:42,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 06:38:42,721 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #86#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,721 INFO L272 TraceCheckUtils]: 81: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,722 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #84#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,722 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,722 INFO L272 TraceCheckUtils]: 76: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {15404#(not (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {15404#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,724 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #86#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,724 INFO L272 TraceCheckUtils]: 67: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,724 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #84#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,725 INFO L272 TraceCheckUtils]: 62: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post6 < 20);havoc #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,726 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #82#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,726 INFO L272 TraceCheckUtils]: 54: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,726 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #80#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L272 TraceCheckUtils]: 49: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #78#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L272 TraceCheckUtils]: 44: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 06:38:42,729 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #82#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,729 INFO L272 TraceCheckUtils]: 36: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,743 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #80#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L272 TraceCheckUtils]: 31: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #78#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L272 TraceCheckUtils]: 26: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {15404#(not (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 06:38:42,745 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 20);havoc #t~post5; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 06:38:42,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 06:38:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:38:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:38:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814397950] [2022-04-28 06:38:42,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:38:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580172060] [2022-04-28 06:38:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580172060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:38:42,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:38:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 06:38:42,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:38:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482527172] [2022-04-28 06:38:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482527172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:38:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:38:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:38:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485093627] [2022-04-28 06:38:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:38:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 06:38:42,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:38:42,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 06:38:42,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:42,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:38:42,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:42,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:38:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:38:42,792 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 06:38:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:43,077 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-28 06:38:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:38:43,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 06:38:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:38:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 06:38:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 06:38:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 06:38:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 06:38:43,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 06:38:43,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:43,157 INFO L225 Difference]: With dead ends: 197 [2022-04-28 06:38:43,157 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 06:38:43,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:38:43,158 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:38:43,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:38:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 06:38:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-28 06:38:43,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:38:43,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:43,300 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:43,301 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:43,303 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 06:38:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 06:38:43,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:43,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:43,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 06:38:43,304 INFO L87 Difference]: Start difference. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 06:38:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:43,307 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 06:38:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 06:38:43,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:43,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:43,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:38:43,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:38:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-28 06:38:43,319 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-28 06:38:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:38:43,319 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-28 06:38:43,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 06:38:43,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-28 06:38:43,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-28 06:38:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 06:38:43,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:38:43,576 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:38:43,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 06:38:43,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:43,777 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:38:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:38:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-28 06:38:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [766116789] [2022-04-28 06:38:47,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:38:47,418 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:38:47,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:38:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-28 06:38:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:38:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233304585] [2022-04-28 06:38:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:38:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:38:47,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:38:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908170016] [2022-04-28 06:38:47,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:38:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:38:47,428 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:38:47,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 06:38:47,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:38:47,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:38:47,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:38:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:38:47,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:38:47,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 06:38:47,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:47,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:47,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:47,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:47,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {16796#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:47,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {16796#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {16812#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,810 INFO L272 TraceCheckUtils]: 8: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,811 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,812 INFO L272 TraceCheckUtils]: 13: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,813 INFO L272 TraceCheckUtils]: 18: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,814 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {16812#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:47,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {16812#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {16867#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,816 INFO L272 TraceCheckUtils]: 26: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,817 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,817 INFO L272 TraceCheckUtils]: 31: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,818 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,819 INFO L272 TraceCheckUtils]: 36: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,820 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {16867#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:47,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {16867#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {16922#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,821 INFO L272 TraceCheckUtils]: 44: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,822 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,823 INFO L272 TraceCheckUtils]: 49: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,824 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,824 INFO L272 TraceCheckUtils]: 54: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,825 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {16922#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:47,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {16922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {16977#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,827 INFO L272 TraceCheckUtils]: 62: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,828 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,828 INFO L272 TraceCheckUtils]: 67: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,829 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,830 INFO L272 TraceCheckUtils]: 72: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,831 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,831 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,831 INFO L290 TraceCheckUtils]: 77: Hoare triple {16977#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:47,831 INFO L290 TraceCheckUtils]: 78: Hoare triple {16977#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17032#(<= |main_#t~post5| 4)} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 20);havoc #t~post6; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 06:38:47,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 06:38:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 06:38:47,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 06:38:48,156 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 06:38:48,156 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,156 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,157 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 20);havoc #t~post6; {16789#false} is VALID [2022-04-28 06:38:48,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 06:38:48,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {16789#false} is VALID [2022-04-28 06:38:48,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {17106#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17102#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:38:48,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {17106#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,158 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #82#return; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,158 INFO L272 TraceCheckUtils]: 72: Hoare triple {17106#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,159 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #80#return; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,159 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,159 INFO L272 TraceCheckUtils]: 67: Hoare triple {17106#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,159 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #78#return; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,160 INFO L272 TraceCheckUtils]: 62: Hoare triple {17106#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {17106#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {17161#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17106#(< ~counter~0 20)} is VALID [2022-04-28 06:38:48,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {17161#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,164 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #82#return; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,164 INFO L272 TraceCheckUtils]: 54: Hoare triple {17161#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,170 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #80#return; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,170 INFO L272 TraceCheckUtils]: 49: Hoare triple {17161#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,171 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #78#return; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,171 INFO L272 TraceCheckUtils]: 44: Hoare triple {17161#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {17161#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {17216#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17161#(< ~counter~0 19)} is VALID [2022-04-28 06:38:48,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {17216#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,173 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #82#return; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L272 TraceCheckUtils]: 36: Hoare triple {17216#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #80#return; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,173 INFO L272 TraceCheckUtils]: 31: Hoare triple {17216#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,174 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #78#return; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,174 INFO L272 TraceCheckUtils]: 26: Hoare triple {17216#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {17216#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {17271#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17216#(< ~counter~0 18)} is VALID [2022-04-28 06:38:48,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {17271#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,175 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #82#return; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L272 TraceCheckUtils]: 18: Hoare triple {17271#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #80#return; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L272 TraceCheckUtils]: 13: Hoare triple {17271#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,176 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #78#return; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 06:38:48,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 06:38:48,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 06:38:48,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {17271#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 06:38:48,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {17271#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {17326#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17271#(< ~counter~0 17)} is VALID [2022-04-28 06:38:48,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {17326#(< ~counter~0 16)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {17326#(< ~counter~0 16)} is VALID [2022-04-28 06:38:48,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 16)} call #t~ret7 := main(); {17326#(< ~counter~0 16)} is VALID [2022-04-28 06:38:48,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 16)} {16788#true} #92#return; {17326#(< ~counter~0 16)} is VALID [2022-04-28 06:38:48,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 16)} assume true; {17326#(< ~counter~0 16)} is VALID [2022-04-28 06:38:48,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17326#(< ~counter~0 16)} is VALID [2022-04-28 06:38:48,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 06:38:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:38:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:38:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233304585] [2022-04-28 06:38:48,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:38:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908170016] [2022-04-28 06:38:48,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908170016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:38:48,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:38:48,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 06:38:48,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:38:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [766116789] [2022-04-28 06:38:48,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [766116789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:38:48,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:38:48,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:38:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140677910] [2022-04-28 06:38:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:38:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 06:38:48,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:38:48,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:48,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:48,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:38:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:38:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 06:38:48,227 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:48,604 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-28 06:38:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 06:38:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 06:38:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:38:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 06:38:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 06:38:48,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-28 06:38:48,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:48,690 INFO L225 Difference]: With dead ends: 242 [2022-04-28 06:38:48,690 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 06:38:48,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:38:48,691 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:38:48,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:38:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 06:38:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 06:38:48,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:38:48,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:48,823 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:48,824 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:48,826 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 06:38:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 06:38:48,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:48,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:48,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 06:38:48,827 INFO L87 Difference]: Start difference. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 06:38:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:48,830 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 06:38:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 06:38:48,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:48,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:48,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:38:48,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:38:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 06:38:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-28 06:38:48,833 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-28 06:38:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:38:48,834 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-28 06:38:48,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:48,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-28 06:38:49,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 06:38:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 06:38:49,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:38:49,098 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:38:49,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 06:38:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:49,299 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:38:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:38:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-28 06:38:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:49,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389885238] [2022-04-28 06:38:51,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:38:51,415 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:38:51,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:38:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-28 06:38:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:38:51,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307369196] [2022-04-28 06:38:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:38:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:38:51,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:38:51,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540411189] [2022-04-28 06:38:51,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:38:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:51,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:38:51,425 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:38:51,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 06:38:51,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 06:38:51,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:38:51,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 06:38:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:38:51,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:38:51,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 06:38:51,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:51,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:51,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:51,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:51,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {18575#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 06:38:51,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {18575#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {18591#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,847 INFO L272 TraceCheckUtils]: 8: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,848 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,848 INFO L272 TraceCheckUtils]: 13: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,849 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,851 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {18591#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 06:38:51,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {18591#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {18646#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,853 INFO L272 TraceCheckUtils]: 26: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,854 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,854 INFO L272 TraceCheckUtils]: 31: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,855 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,855 INFO L272 TraceCheckUtils]: 36: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,857 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {18646#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 06:38:51,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {18646#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {18701#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,858 INFO L272 TraceCheckUtils]: 44: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,859 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,860 INFO L272 TraceCheckUtils]: 49: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,861 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,861 INFO L272 TraceCheckUtils]: 54: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,862 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 06:38:51,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {18701#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {18756#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,864 INFO L272 TraceCheckUtils]: 62: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,865 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,865 INFO L272 TraceCheckUtils]: 67: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,866 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {18756#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {18756#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 06:38:51,868 INFO L290 TraceCheckUtils]: 74: Hoare triple {18756#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,868 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,868 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,868 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,869 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,869 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,870 INFO L272 TraceCheckUtils]: 81: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,871 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {18799#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {18799#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 06:38:51,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {18799#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18842#(<= |main_#t~post6| 5)} is VALID [2022-04-28 06:38:51,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {18568#false} is VALID [2022-04-28 06:38:51,872 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 06:38:51,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 06:38:51,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 06:38:51,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 06:38:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 296 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 06:38:51,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:38:52,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 06:38:52,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 06:38:52,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 06:38:52,241 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 06:38:52,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {18568#false} is VALID [2022-04-28 06:38:52,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {18874#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18870#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:38:52,242 INFO L290 TraceCheckUtils]: 87: Hoare triple {18874#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {18874#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,242 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 20)} #86#return; {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L272 TraceCheckUtils]: 81: Hoare triple {18874#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 20)} #84#return; {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,243 INFO L272 TraceCheckUtils]: 76: Hoare triple {18874#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {18874#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {18917#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18874#(< ~counter~0 20)} is VALID [2022-04-28 06:38:52,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {18917#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {18917#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,245 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 19)} #86#return; {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,245 INFO L272 TraceCheckUtils]: 67: Hoare triple {18917#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,246 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 19)} #84#return; {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,246 INFO L272 TraceCheckUtils]: 62: Hoare triple {18917#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {18917#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {18960#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18917#(< ~counter~0 19)} is VALID [2022-04-28 06:38:52,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 18)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,248 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #82#return; {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L272 TraceCheckUtils]: 54: Hoare triple {18960#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #80#return; {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,248 INFO L272 TraceCheckUtils]: 49: Hoare triple {18960#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,249 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #78#return; {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,249 INFO L272 TraceCheckUtils]: 44: Hoare triple {18960#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {18960#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {19015#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18960#(< ~counter~0 18)} is VALID [2022-04-28 06:38:52,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {19015#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,250 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #82#return; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L272 TraceCheckUtils]: 36: Hoare triple {19015#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #80#return; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,251 INFO L272 TraceCheckUtils]: 31: Hoare triple {19015#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,252 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #78#return; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,252 INFO L272 TraceCheckUtils]: 26: Hoare triple {19015#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {19015#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {19070#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19015#(< ~counter~0 17)} is VALID [2022-04-28 06:38:52,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {19070#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,253 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #82#return; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,254 INFO L272 TraceCheckUtils]: 18: Hoare triple {19070#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #80#return; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L272 TraceCheckUtils]: 13: Hoare triple {19070#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #78#return; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 06:38:52,256 INFO L272 TraceCheckUtils]: 8: Hoare triple {19070#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 06:38:52,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {19070#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {19125#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19070#(< ~counter~0 16)} is VALID [2022-04-28 06:38:52,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {19125#(< ~counter~0 15)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {19125#(< ~counter~0 15)} is VALID [2022-04-28 06:38:52,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 15)} call #t~ret7 := main(); {19125#(< ~counter~0 15)} is VALID [2022-04-28 06:38:52,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 15)} {18567#true} #92#return; {19125#(< ~counter~0 15)} is VALID [2022-04-28 06:38:52,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 15)} assume true; {19125#(< ~counter~0 15)} is VALID [2022-04-28 06:38:52,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19125#(< ~counter~0 15)} is VALID [2022-04-28 06:38:52,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 06:38:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:38:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:38:52,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307369196] [2022-04-28 06:38:52,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:38:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540411189] [2022-04-28 06:38:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540411189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:38:52,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:38:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 06:38:52,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:38:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389885238] [2022-04-28 06:38:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389885238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:38:52,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:38:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:38:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146319091] [2022-04-28 06:38:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:38:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 06:38:52,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:38:52,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:52,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:38:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:52,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:38:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:38:52,309 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:52,789 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-28 06:38:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 06:38:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 06:38:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:38:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 06:38:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 06:38:52,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-28 06:38:52,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:52,888 INFO L225 Difference]: With dead ends: 240 [2022-04-28 06:38:52,888 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 06:38:52,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:38:52,889 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:38:52,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:38:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 06:38:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-28 06:38:53,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:38:53,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 06:38:53,063 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 06:38:53,063 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 06:38:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:53,067 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 06:38:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 06:38:53,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:53,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:53,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 06:38:53,068 INFO L87 Difference]: Start difference. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 06:38:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:38:53,071 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 06:38:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 06:38:53,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:38:53,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:38:53,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:38:53,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:38:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 06:38:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-28 06:38:53,076 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-28 06:38:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:38:53,076 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-28 06:38:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 06:38:53,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-28 06:38:53,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:38:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-28 06:38:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 06:38:53,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:38:53,410 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:38:53,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 06:38:53,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:53,611 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:38:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:38:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-28 06:38:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:38:53,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074297594] [2022-04-28 06:38:57,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:38:57,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:38:57,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:38:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-28 06:38:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:38:57,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12637768] [2022-04-28 06:38:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:38:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:38:57,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:38:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473710878] [2022-04-28 06:38:57,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:38:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:38:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:38:57,725 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:38:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 06:38:57,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:38:57,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:38:57,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:38:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:38:57,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:38:58,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 06:38:58,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 06:38:58,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 06:38:58,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 06:38:58,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,430 INFO L272 TraceCheckUtils]: 8: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,431 INFO L272 TraceCheckUtils]: 13: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,432 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,432 INFO L272 TraceCheckUtils]: 18: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,432 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:38:58,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,434 INFO L272 TraceCheckUtils]: 26: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,434 INFO L272 TraceCheckUtils]: 31: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,435 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,435 INFO L272 TraceCheckUtils]: 36: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,436 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,437 INFO L272 TraceCheckUtils]: 44: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,437 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,437 INFO L272 TraceCheckUtils]: 49: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,438 INFO L272 TraceCheckUtils]: 54: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,439 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,440 INFO L272 TraceCheckUtils]: 62: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,440 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,441 INFO L272 TraceCheckUtils]: 67: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,441 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #86#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 06:38:58,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,443 INFO L272 TraceCheckUtils]: 76: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,443 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,443 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #84#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,444 INFO L272 TraceCheckUtils]: 81: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:38:58,444 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:38:58,444 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:38:58,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:38:58,444 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #86#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,445 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} is VALID [2022-04-28 06:38:58,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,447 INFO L290 TraceCheckUtils]: 89: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 06:38:58,447 INFO L272 TraceCheckUtils]: 90: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:38:58,448 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:38:58,448 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 06:38:58,448 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 06:38:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:38:58,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:39:34,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 06:39:34,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 06:39:34,478 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:39:34,479 INFO L272 TraceCheckUtils]: 90: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:39:34,479 INFO L290 TraceCheckUtils]: 89: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 20);havoc #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:39:34,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:39:34,494 INFO L290 TraceCheckUtils]: 87: Hoare triple {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:39:34,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:39:34,509 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:39:34,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,509 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,509 INFO L272 TraceCheckUtils]: 81: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,510 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:39:34,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,510 INFO L272 TraceCheckUtils]: 76: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 20);havoc #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:39:34,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:39:34,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:39:34,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:34,841 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #86#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,841 INFO L272 TraceCheckUtils]: 67: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,842 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,843 INFO L272 TraceCheckUtils]: 62: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post6 < 20);havoc #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,856 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,857 INFO L272 TraceCheckUtils]: 54: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,858 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,858 INFO L272 TraceCheckUtils]: 49: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,859 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:34,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:34,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:34,859 INFO L272 TraceCheckUtils]: 44: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:34,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post5 < 20);havoc #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:34,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:35,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 06:39:35,155 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #82#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,155 INFO L272 TraceCheckUtils]: 36: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,156 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,156 INFO L272 TraceCheckUtils]: 31: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,157 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,157 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post5 < 20);havoc #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 06:39:35,185 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,186 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,186 INFO L272 TraceCheckUtils]: 13: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,186 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 06:39:35,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 06:39:35,187 INFO L272 TraceCheckUtils]: 8: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 06:39:35,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(#t~post5 < 20);havoc #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 06:39:35,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 06:39:35,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 06:39:35,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 06:39:35,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 06:39:35,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 06:39:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 06:39:35,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:39:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12637768] [2022-04-28 06:39:35,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:39:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473710878] [2022-04-28 06:39:35,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473710878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:39:35,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:39:35,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 06:39:35,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:39:35,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074297594] [2022-04-28 06:39:35,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074297594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:39:35,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:39:35,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:39:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023870205] [2022-04-28 06:39:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:39:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 06:39:35,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:39:35,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 06:39:35,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:39:35,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:39:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:39:35,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:39:35,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2022-04-28 06:39:35,242 INFO L87 Difference]: Start difference. First operand 226 states and 263 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 06:39:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:39:36,710 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-28 06:39:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 06:39:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 06:39:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:39:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 06:39:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 06:39:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 06:39:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 06:39:36,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-28 06:39:36,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:39:36,844 INFO L225 Difference]: With dead ends: 275 [2022-04-28 06:39:36,844 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 06:39:36,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-04-28 06:39:36,846 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:39:36,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:39:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 06:39:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-28 06:39:37,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:39:37,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 06:39:37,071 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 06:39:37,072 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 06:39:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:39:37,075 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 06:39:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 06:39:37,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:39:37,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:39:37,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 06:39:37,076 INFO L87 Difference]: Start difference. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 06:39:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:39:37,080 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 06:39:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 06:39:37,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:39:37,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:39:37,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:39:37,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:39:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 06:39:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-28 06:39:37,085 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-28 06:39:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:39:37,085 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-28 06:39:37,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 06:39:37,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-28 06:39:37,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:39:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-28 06:39:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 06:39:37,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:39:37,428 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:39:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 06:39:37,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:39:37,645 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:39:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:39:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-28 06:39:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:39:37,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933226739] [2022-04-28 06:39:41,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:39:41,402 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:39:41,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:39:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-28 06:39:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:39:41,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356882642] [2022-04-28 06:39:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:39:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:39:41,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:39:41,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281148707] [2022-04-28 06:39:41,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:39:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:39:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:39:41,412 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:39:41,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 06:39:41,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:39:41,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:39:41,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 06:39:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:39:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:42:52,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 20);havoc #t~post5; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 06:42:52,216 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:52,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:42:52,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:52,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:52,218 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22623#true} #82#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:42:54,220 WARN L290 TraceCheckUtils]: 23: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-28 06:42:54,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:54,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:54,221 INFO L272 TraceCheckUtils]: 26: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:54,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:54,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:54,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:54,222 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #78#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:54,222 INFO L272 TraceCheckUtils]: 31: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:54,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:54,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:54,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:54,222 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #80#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:54,223 INFO L272 TraceCheckUtils]: 36: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:54,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:54,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:54,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:54,223 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #82#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,226 WARN L290 TraceCheckUtils]: 41: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-28 06:42:56,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,227 INFO L272 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:56,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:56,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:56,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:56,228 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #78#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,228 INFO L272 TraceCheckUtils]: 49: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:56,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:56,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:56,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:56,228 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #80#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,228 INFO L272 TraceCheckUtils]: 54: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:56,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:56,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:56,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:56,229 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #82#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,230 INFO L272 TraceCheckUtils]: 62: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:56,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:56,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:56,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:56,231 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #84#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:56,231 INFO L272 TraceCheckUtils]: 67: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:56,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:42:56,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:56,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:56,232 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #86#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:42:57,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:57,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:57,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:57,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(#t~post6 < 20);havoc #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:57,788 INFO L272 TraceCheckUtils]: 76: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:57,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:57,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:57,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:57,789 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #84#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:57,789 INFO L272 TraceCheckUtils]: 81: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:57,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:42:57,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:57,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:42:57,790 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #86#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 06:42:59,801 WARN L290 TraceCheckUtils]: 86: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is UNKNOWN [2022-04-28 06:42:59,803 INFO L290 TraceCheckUtils]: 87: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 06:42:59,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 06:42:59,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume !!(#t~post6 < 20);havoc #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 06:42:59,807 INFO L272 TraceCheckUtils]: 90: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:42:59,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:42:59,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:42:59,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:42:59,808 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #84#return; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 06:42:59,809 INFO L272 TraceCheckUtils]: 95: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:42:59,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:42:59,809 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 06:42:59,809 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 06:42:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 106 proven. 53 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-04-28 06:42:59,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:44:56,540 WARN L232 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 06:45:42,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 06:45:42,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 06:45:42,812 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:45:42,813 INFO L272 TraceCheckUtils]: 95: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:45:42,813 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #84#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:45:42,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:42,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:42,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:42,813 INFO L272 TraceCheckUtils]: 90: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:42,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post6 < 20);havoc #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:45:42,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:45:42,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:45:42,827 INFO L290 TraceCheckUtils]: 86: Hoare triple {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:45:42,840 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} is VALID [2022-04-28 06:45:42,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:45:42,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:45:42,842 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:45:42,842 INFO L272 TraceCheckUtils]: 81: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:42,842 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:42,842 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:42,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:42,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:42,842 INFO L272 TraceCheckUtils]: 76: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:42,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:42,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:42,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,344 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-28 06:45:43,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:45:43,345 INFO L290 TraceCheckUtils]: 69: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:45:43,345 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:45:43,346 INFO L272 TraceCheckUtils]: 67: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,346 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,346 INFO L272 TraceCheckUtils]: 62: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 06:45:43,352 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #82#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,352 INFO L272 TraceCheckUtils]: 54: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #80#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L272 TraceCheckUtils]: 49: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #78#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,353 INFO L272 TraceCheckUtils]: 44: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !!(#t~post5 < 20);havoc #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 06:45:43,386 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #82#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,386 INFO L272 TraceCheckUtils]: 36: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,386 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #80#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L272 TraceCheckUtils]: 31: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #78#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,387 INFO L272 TraceCheckUtils]: 26: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(#t~post5 < 20);havoc #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 06:45:43,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 06:45:43,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 20);havoc #t~post5; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 06:45:43,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 06:45:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 101 proven. 31 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-28 06:45:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:45:43,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356882642] [2022-04-28 06:45:43,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:45:43,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281148707] [2022-04-28 06:45:43,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281148707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:45:43,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:45:43,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-04-28 06:45:43,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:45:43,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933226739] [2022-04-28 06:45:43,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933226739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:45:43,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:45:43,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:45:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026336223] [2022-04-28 06:45:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:45:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 06:45:43,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:45:43,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 06:45:47,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 62 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:45:47,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:45:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:45:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:45:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=296, Unknown=1, NotChecked=0, Total=380 [2022-04-28 06:45:47,365 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 06:45:49,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:45:56,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:11,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:13,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:14,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:16,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:18,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:20,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:23,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:28,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:31,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:35,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:38,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:46:43,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:47:01,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:47:03,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:47:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:05,279 INFO L93 Difference]: Finished difference Result 271 states and 325 transitions. [2022-04-28 06:47:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 06:47:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 06:47:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:47:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 06:47:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-28 06:47:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 06:47:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-28 06:47:05,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2022-04-28 06:47:16,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 105 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:47:16,173 INFO L225 Difference]: With dead ends: 271 [2022-04-28 06:47:16,173 INFO L226 Difference]: Without dead ends: 269 [2022-04-28 06:47:16,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=96, Invalid=365, Unknown=1, NotChecked=0, Total=462 [2022-04-28 06:47:16,174 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2022-04-28 06:47:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 240 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 11 Unknown, 133 Unchecked, 36.7s Time] [2022-04-28 06:47:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-28 06:47:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-04-28 06:47:16,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:47:16,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 06:47:16,512 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 06:47:16,512 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 06:47:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:16,518 INFO L93 Difference]: Finished difference Result 269 states and 323 transitions. [2022-04-28 06:47:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2022-04-28 06:47:16,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:47:16,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:47:16,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 269 states. [2022-04-28 06:47:16,519 INFO L87 Difference]: Start difference. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 269 states. [2022-04-28 06:47:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:16,524 INFO L93 Difference]: Finished difference Result 269 states and 323 transitions. [2022-04-28 06:47:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2022-04-28 06:47:16,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:47:16,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:47:16,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:47:16,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:47:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 06:47:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 304 transitions. [2022-04-28 06:47:16,530 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 304 transitions. Word has length 99 [2022-04-28 06:47:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:47:16,530 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 304 transitions. [2022-04-28 06:47:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 06:47:16,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 304 transitions. [2022-04-28 06:47:17,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:47:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 304 transitions. [2022-04-28 06:47:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 06:47:17,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:47:17,058 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:47:17,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 06:47:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:47:17,273 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:47:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:47:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-28 06:47:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:47:17,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393032420] [2022-04-28 06:47:19,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:47:19,440 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:47:19,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:47:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-28 06:47:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:47:19,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864752530] [2022-04-28 06:47:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:47:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:47:19,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:47:19,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409462855] [2022-04-28 06:47:19,476 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:47:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:47:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:47:19,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:47:19,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 06:47:19,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 06:47:19,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:47:19,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 06:47:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:47:19,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:47:19,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {24836#true} call ULTIMATE.init(); {24836#true} is VALID [2022-04-28 06:47:19,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {24836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24836#true} is VALID [2022-04-28 06:47:19,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24836#true} {24836#true} #92#return; {24836#true} is VALID [2022-04-28 06:47:19,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {24836#true} call #t~ret7 := main(); {24836#true} is VALID [2022-04-28 06:47:19,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {24836#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {24856#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,827 INFO L272 TraceCheckUtils]: 8: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #78#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #80#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,828 INFO L272 TraceCheckUtils]: 18: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,828 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #82#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {24856#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {24856#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,829 INFO L272 TraceCheckUtils]: 26: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #78#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,830 INFO L272 TraceCheckUtils]: 31: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #80#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,830 INFO L272 TraceCheckUtils]: 36: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,831 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #82#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {24856#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {24856#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,832 INFO L272 TraceCheckUtils]: 44: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #78#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,832 INFO L272 TraceCheckUtils]: 49: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,833 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #80#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,833 INFO L272 TraceCheckUtils]: 54: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,833 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #82#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {24856#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {24856#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,834 INFO L272 TraceCheckUtils]: 62: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,834 INFO L290 TraceCheckUtils]: 64: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,834 INFO L290 TraceCheckUtils]: 65: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,835 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #84#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,835 INFO L272 TraceCheckUtils]: 67: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,835 INFO L290 TraceCheckUtils]: 68: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,835 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #86#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {24856#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {24856#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {24856#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 75: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,836 INFO L272 TraceCheckUtils]: 76: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 77: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 78: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,836 INFO L290 TraceCheckUtils]: 79: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,837 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #84#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,837 INFO L272 TraceCheckUtils]: 81: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:19,837 INFO L290 TraceCheckUtils]: 83: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:19,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:19,837 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24836#true} {24856#(= main_~B~0 1)} #86#return; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {24856#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,838 INFO L290 TraceCheckUtils]: 87: Hoare triple {24856#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {24856#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {24856#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24856#(= main_~B~0 1)} is VALID [2022-04-28 06:47:19,838 INFO L272 TraceCheckUtils]: 90: Hoare triple {24856#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,838 INFO L290 TraceCheckUtils]: 91: Hoare triple {24836#true} ~cond := #in~cond; {25115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:47:19,839 INFO L290 TraceCheckUtils]: 92: Hoare triple {25115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:19,839 INFO L290 TraceCheckUtils]: 93: Hoare triple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:19,839 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} {24856#(= main_~B~0 1)} #84#return; {25126#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-28 06:47:19,840 INFO L272 TraceCheckUtils]: 95: Hoare triple {25126#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:19,840 INFO L290 TraceCheckUtils]: 96: Hoare triple {24836#true} ~cond := #in~cond; {25115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:47:19,840 INFO L290 TraceCheckUtils]: 97: Hoare triple {25115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:19,840 INFO L290 TraceCheckUtils]: 98: Hoare triple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:19,841 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} {25126#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25142#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-28 06:47:19,842 INFO L290 TraceCheckUtils]: 100: Hoare triple {25142#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25146#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-28 06:47:19,842 INFO L272 TraceCheckUtils]: 101: Hoare triple {25146#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {25150#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:47:19,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {25150#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25154#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:47:19,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {25154#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24837#false} is VALID [2022-04-28 06:47:19,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {24837#false} assume !false; {24837#false} is VALID [2022-04-28 06:47:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 06:47:19,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:47:55,597 INFO L290 TraceCheckUtils]: 104: Hoare triple {24837#false} assume !false; {24837#false} is VALID [2022-04-28 06:47:55,598 INFO L290 TraceCheckUtils]: 103: Hoare triple {25154#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24837#false} is VALID [2022-04-28 06:47:55,598 INFO L290 TraceCheckUtils]: 102: Hoare triple {25150#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25154#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:47:55,598 INFO L272 TraceCheckUtils]: 101: Hoare triple {25170#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {25150#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:47:55,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {25174#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {25170#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:47:55,601 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} {25178#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #86#return; {25174#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 06:47:55,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:55,602 INFO L290 TraceCheckUtils]: 97: Hoare triple {25188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:55,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {24836#true} ~cond := #in~cond; {25188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:47:55,602 INFO L272 TraceCheckUtils]: 95: Hoare triple {25178#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,602 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} {24836#true} #84#return; {25178#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:47:55,603 INFO L290 TraceCheckUtils]: 93: Hoare triple {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:55,603 INFO L290 TraceCheckUtils]: 92: Hoare triple {25188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:47:55,603 INFO L290 TraceCheckUtils]: 91: Hoare triple {24836#true} ~cond := #in~cond; {25188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:47:55,604 INFO L272 TraceCheckUtils]: 90: Hoare triple {24836#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {24836#true} assume !!(#t~post6 < 20);havoc #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 88: Hoare triple {24836#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 87: Hoare triple {24836#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 86: Hoare triple {24836#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24836#true} {24836#true} #86#return; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L272 TraceCheckUtils]: 81: Hoare triple {24836#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24836#true} {24836#true} #84#return; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L272 TraceCheckUtils]: 76: Hoare triple {24836#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {24836#true} assume !!(#t~post6 < 20);havoc #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {24836#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {24836#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {24836#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24836#true} is VALID [2022-04-28 06:47:55,604 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24836#true} {24836#true} #86#return; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L272 TraceCheckUtils]: 67: Hoare triple {24836#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24836#true} {24836#true} #84#return; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L272 TraceCheckUtils]: 62: Hoare triple {24836#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {24836#true} assume !!(#t~post6 < 20);havoc #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {24836#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {24836#true} assume !(~r~0 >= ~d~0); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24836#true} {24836#true} #82#return; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L272 TraceCheckUtils]: 54: Hoare triple {24836#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24836#true} {24836#true} #80#return; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L272 TraceCheckUtils]: 49: Hoare triple {24836#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24836#true} {24836#true} #78#return; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L272 TraceCheckUtils]: 44: Hoare triple {24836#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {24836#true} assume !!(#t~post5 < 20);havoc #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {24836#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {24836#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24836#true} {24836#true} #82#return; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L272 TraceCheckUtils]: 36: Hoare triple {24836#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24836#true} {24836#true} #80#return; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,606 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24836#true} {24836#true} #78#return; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L272 TraceCheckUtils]: 26: Hoare triple {24836#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {24836#true} assume !!(#t~post5 < 20);havoc #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {24836#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {24836#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24836#true} {24836#true} #82#return; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L272 TraceCheckUtils]: 18: Hoare triple {24836#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24836#true} {24836#true} #80#return; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L272 TraceCheckUtils]: 13: Hoare triple {24836#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24836#true} {24836#true} #78#return; {24836#true} is VALID [2022-04-28 06:47:55,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {24836#true} assume !(0 == ~cond); {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {24836#true} ~cond := #in~cond; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L272 TraceCheckUtils]: 8: Hoare triple {24836#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {24836#true} assume !!(#t~post5 < 20);havoc #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {24836#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {24836#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {24836#true} call #t~ret7 := main(); {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24836#true} {24836#true} #92#return; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {24836#true} assume true; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {24836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {24836#true} call ULTIMATE.init(); {24836#true} is VALID [2022-04-28 06:47:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 06:47:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:47:55,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864752530] [2022-04-28 06:47:55,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:47:55,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409462855] [2022-04-28 06:47:55,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409462855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:47:55,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:47:55,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 06:47:55,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:47:55,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393032420] [2022-04-28 06:47:55,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393032420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:47:55,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:47:55,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:47:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095275191] [2022-04-28 06:47:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:47:55,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 06:47:55,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:47:55,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 06:47:55,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:47:55,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:47:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:47:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:47:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 06:47:55,645 INFO L87 Difference]: Start difference. First operand 258 states and 304 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 06:47:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:56,597 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2022-04-28 06:47:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:47:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 06:47:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:47:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 06:47:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 06:47:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 06:47:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 06:47:56,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 06:47:56,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:47:56,657 INFO L225 Difference]: With dead ends: 275 [2022-04-28 06:47:56,657 INFO L226 Difference]: Without dead ends: 270 [2022-04-28 06:47:56,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:47:56,658 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:47:56,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 118 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:47:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-28 06:47:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-04-28 06:47:57,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:47:57,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 06:47:57,024 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 06:47:57,024 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 06:47:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:57,029 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-04-28 06:47:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2022-04-28 06:47:57,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:47:57,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:47:57,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 270 states. [2022-04-28 06:47:57,030 INFO L87 Difference]: Start difference. First operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 270 states. [2022-04-28 06:47:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:47:57,035 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-04-28 06:47:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2022-04-28 06:47:57,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:47:57,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:47:57,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:47:57,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:47:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 06:47:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 285 transitions. [2022-04-28 06:47:57,041 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 285 transitions. Word has length 105 [2022-04-28 06:47:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:47:57,041 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 285 transitions. [2022-04-28 06:47:57,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 06:47:57,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 285 transitions. [2022-04-28 06:47:57,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:47:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 285 transitions. [2022-04-28 06:47:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 06:47:57,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:47:57,554 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:47:57,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 06:47:57,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 06:47:57,755 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:47:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:47:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 7 times [2022-04-28 06:47:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:47:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993027867] [2022-04-28 06:48:00,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:00,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:00,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 8 times [2022-04-28 06:48:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:00,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912536162] [2022-04-28 06:48:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:00,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:00,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294130777] [2022-04-28 06:48:00,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:48:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:00,192 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:00,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 06:48:00,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:48:00,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:00,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 06:48:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:00,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:00,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {27083#true} call ULTIMATE.init(); {27083#true} is VALID [2022-04-28 06:48:00,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {27083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27091#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:00,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#(<= ~counter~0 0)} assume true; {27091#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:00,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27091#(<= ~counter~0 0)} {27083#true} #92#return; {27091#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:00,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {27091#(<= ~counter~0 0)} call #t~ret7 := main(); {27091#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:00,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {27091#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27091#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:00,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {27091#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {27107#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,718 INFO L272 TraceCheckUtils]: 8: Hoare triple {27107#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {27107#(<= ~counter~0 1)} ~cond := #in~cond; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {27107#(<= ~counter~0 1)} assume !(0 == ~cond); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {27107#(<= ~counter~0 1)} assume true; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,719 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27107#(<= ~counter~0 1)} {27107#(<= ~counter~0 1)} #78#return; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,720 INFO L272 TraceCheckUtils]: 13: Hoare triple {27107#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {27107#(<= ~counter~0 1)} ~cond := #in~cond; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {27107#(<= ~counter~0 1)} assume !(0 == ~cond); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {27107#(<= ~counter~0 1)} assume true; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,721 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27107#(<= ~counter~0 1)} {27107#(<= ~counter~0 1)} #80#return; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,721 INFO L272 TraceCheckUtils]: 18: Hoare triple {27107#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {27107#(<= ~counter~0 1)} ~cond := #in~cond; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {27107#(<= ~counter~0 1)} assume !(0 == ~cond); {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {27107#(<= ~counter~0 1)} assume true; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,722 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27107#(<= ~counter~0 1)} {27107#(<= ~counter~0 1)} #82#return; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {27107#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27107#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:00,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {27107#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {27162#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,724 INFO L272 TraceCheckUtils]: 26: Hoare triple {27162#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {27162#(<= ~counter~0 2)} ~cond := #in~cond; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {27162#(<= ~counter~0 2)} assume !(0 == ~cond); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {27162#(<= ~counter~0 2)} assume true; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,725 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27162#(<= ~counter~0 2)} {27162#(<= ~counter~0 2)} #78#return; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,725 INFO L272 TraceCheckUtils]: 31: Hoare triple {27162#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {27162#(<= ~counter~0 2)} ~cond := #in~cond; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {27162#(<= ~counter~0 2)} assume !(0 == ~cond); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {27162#(<= ~counter~0 2)} assume true; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,726 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27162#(<= ~counter~0 2)} {27162#(<= ~counter~0 2)} #80#return; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,727 INFO L272 TraceCheckUtils]: 36: Hoare triple {27162#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {27162#(<= ~counter~0 2)} ~cond := #in~cond; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {27162#(<= ~counter~0 2)} assume !(0 == ~cond); {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {27162#(<= ~counter~0 2)} assume true; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,728 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27162#(<= ~counter~0 2)} {27162#(<= ~counter~0 2)} #82#return; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {27162#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27162#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:00,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {27162#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {27217#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,729 INFO L272 TraceCheckUtils]: 44: Hoare triple {27217#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {27217#(<= ~counter~0 3)} ~cond := #in~cond; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {27217#(<= ~counter~0 3)} assume !(0 == ~cond); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {27217#(<= ~counter~0 3)} assume true; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,730 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27217#(<= ~counter~0 3)} {27217#(<= ~counter~0 3)} #78#return; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,731 INFO L272 TraceCheckUtils]: 49: Hoare triple {27217#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {27217#(<= ~counter~0 3)} ~cond := #in~cond; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {27217#(<= ~counter~0 3)} assume !(0 == ~cond); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {27217#(<= ~counter~0 3)} assume true; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,732 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27217#(<= ~counter~0 3)} {27217#(<= ~counter~0 3)} #80#return; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,732 INFO L272 TraceCheckUtils]: 54: Hoare triple {27217#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {27217#(<= ~counter~0 3)} ~cond := #in~cond; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {27217#(<= ~counter~0 3)} assume !(0 == ~cond); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {27217#(<= ~counter~0 3)} assume true; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,733 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27217#(<= ~counter~0 3)} {27217#(<= ~counter~0 3)} #82#return; {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {27217#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {27217#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:00,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {27217#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {27272#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,735 INFO L272 TraceCheckUtils]: 62: Hoare triple {27272#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,735 INFO L290 TraceCheckUtils]: 63: Hoare triple {27272#(<= ~counter~0 4)} ~cond := #in~cond; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {27272#(<= ~counter~0 4)} assume !(0 == ~cond); {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {27272#(<= ~counter~0 4)} assume true; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,736 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27272#(<= ~counter~0 4)} {27272#(<= ~counter~0 4)} #84#return; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,737 INFO L272 TraceCheckUtils]: 67: Hoare triple {27272#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {27272#(<= ~counter~0 4)} ~cond := #in~cond; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {27272#(<= ~counter~0 4)} assume !(0 == ~cond); {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {27272#(<= ~counter~0 4)} assume true; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,738 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27272#(<= ~counter~0 4)} {27272#(<= ~counter~0 4)} #86#return; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {27272#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {27272#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27272#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:00,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {27272#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {27315#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,740 INFO L272 TraceCheckUtils]: 76: Hoare triple {27315#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {27315#(<= ~counter~0 5)} ~cond := #in~cond; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {27315#(<= ~counter~0 5)} assume !(0 == ~cond); {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {27315#(<= ~counter~0 5)} assume true; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,745 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27315#(<= ~counter~0 5)} {27315#(<= ~counter~0 5)} #84#return; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,745 INFO L272 TraceCheckUtils]: 81: Hoare triple {27315#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {27315#(<= ~counter~0 5)} ~cond := #in~cond; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {27315#(<= ~counter~0 5)} assume !(0 == ~cond); {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {27315#(<= ~counter~0 5)} assume true; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,747 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27315#(<= ~counter~0 5)} {27315#(<= ~counter~0 5)} #86#return; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {27315#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,748 INFO L290 TraceCheckUtils]: 87: Hoare triple {27315#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27315#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:00,749 INFO L290 TraceCheckUtils]: 88: Hoare triple {27315#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {27358#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,750 INFO L272 TraceCheckUtils]: 90: Hoare triple {27358#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,750 INFO L290 TraceCheckUtils]: 91: Hoare triple {27358#(<= ~counter~0 6)} ~cond := #in~cond; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,751 INFO L290 TraceCheckUtils]: 92: Hoare triple {27358#(<= ~counter~0 6)} assume !(0 == ~cond); {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,751 INFO L290 TraceCheckUtils]: 93: Hoare triple {27358#(<= ~counter~0 6)} assume true; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,751 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27358#(<= ~counter~0 6)} {27358#(<= ~counter~0 6)} #84#return; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,752 INFO L272 TraceCheckUtils]: 95: Hoare triple {27358#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {27358#(<= ~counter~0 6)} ~cond := #in~cond; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {27358#(<= ~counter~0 6)} assume !(0 == ~cond); {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {27358#(<= ~counter~0 6)} assume true; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,753 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27358#(<= ~counter~0 6)} {27358#(<= ~counter~0 6)} #86#return; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,753 INFO L290 TraceCheckUtils]: 100: Hoare triple {27358#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,753 INFO L290 TraceCheckUtils]: 101: Hoare triple {27358#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27358#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:00,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {27358#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27401#(<= |main_#t~post6| 6)} is VALID [2022-04-28 06:48:00,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {27401#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {27084#false} is VALID [2022-04-28 06:48:00,754 INFO L272 TraceCheckUtils]: 104: Hoare triple {27084#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27084#false} is VALID [2022-04-28 06:48:00,754 INFO L290 TraceCheckUtils]: 105: Hoare triple {27084#false} ~cond := #in~cond; {27084#false} is VALID [2022-04-28 06:48:00,754 INFO L290 TraceCheckUtils]: 106: Hoare triple {27084#false} assume 0 == ~cond; {27084#false} is VALID [2022-04-28 06:48:00,754 INFO L290 TraceCheckUtils]: 107: Hoare triple {27084#false} assume !false; {27084#false} is VALID [2022-04-28 06:48:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 414 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 06:48:00,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:01,209 INFO L290 TraceCheckUtils]: 107: Hoare triple {27084#false} assume !false; {27084#false} is VALID [2022-04-28 06:48:01,209 INFO L290 TraceCheckUtils]: 106: Hoare triple {27084#false} assume 0 == ~cond; {27084#false} is VALID [2022-04-28 06:48:01,209 INFO L290 TraceCheckUtils]: 105: Hoare triple {27084#false} ~cond := #in~cond; {27084#false} is VALID [2022-04-28 06:48:01,209 INFO L272 TraceCheckUtils]: 104: Hoare triple {27084#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27084#false} is VALID [2022-04-28 06:48:01,210 INFO L290 TraceCheckUtils]: 103: Hoare triple {27429#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {27084#false} is VALID [2022-04-28 06:48:01,210 INFO L290 TraceCheckUtils]: 102: Hoare triple {27433#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27429#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:48:01,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {27433#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,210 INFO L290 TraceCheckUtils]: 100: Hoare triple {27433#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,211 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27083#true} {27433#(< ~counter~0 20)} #86#return; {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,211 INFO L290 TraceCheckUtils]: 98: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,211 INFO L290 TraceCheckUtils]: 97: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,211 INFO L290 TraceCheckUtils]: 96: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,211 INFO L272 TraceCheckUtils]: 95: Hoare triple {27433#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,211 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27083#true} {27433#(< ~counter~0 20)} #84#return; {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,211 INFO L290 TraceCheckUtils]: 93: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,212 INFO L272 TraceCheckUtils]: 90: Hoare triple {27433#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {27433#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {27476#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27433#(< ~counter~0 20)} is VALID [2022-04-28 06:48:01,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {27476#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {27476#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,214 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27083#true} {27476#(< ~counter~0 19)} #86#return; {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,214 INFO L272 TraceCheckUtils]: 81: Hoare triple {27476#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,214 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27083#true} {27476#(< ~counter~0 19)} #84#return; {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,215 INFO L272 TraceCheckUtils]: 76: Hoare triple {27476#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {27476#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {27519#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27476#(< ~counter~0 19)} is VALID [2022-04-28 06:48:01,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {27519#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {27519#(< ~counter~0 18)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,216 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27083#true} {27519#(< ~counter~0 18)} #86#return; {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L272 TraceCheckUtils]: 67: Hoare triple {27519#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27083#true} {27519#(< ~counter~0 18)} #84#return; {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L272 TraceCheckUtils]: 62: Hoare triple {27519#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {27519#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {27562#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27519#(< ~counter~0 18)} is VALID [2022-04-28 06:48:01,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {27562#(< ~counter~0 17)} assume !(~r~0 >= ~d~0); {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,219 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27083#true} {27562#(< ~counter~0 17)} #82#return; {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L272 TraceCheckUtils]: 54: Hoare triple {27562#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27083#true} {27562#(< ~counter~0 17)} #80#return; {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,219 INFO L272 TraceCheckUtils]: 49: Hoare triple {27562#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,220 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27083#true} {27562#(< ~counter~0 17)} #78#return; {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,220 INFO L272 TraceCheckUtils]: 44: Hoare triple {27562#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {27562#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {27617#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27562#(< ~counter~0 17)} is VALID [2022-04-28 06:48:01,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {27617#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,221 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27083#true} {27617#(< ~counter~0 16)} #82#return; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L272 TraceCheckUtils]: 36: Hoare triple {27617#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27083#true} {27617#(< ~counter~0 16)} #80#return; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,222 INFO L272 TraceCheckUtils]: 31: Hoare triple {27617#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,223 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27083#true} {27617#(< ~counter~0 16)} #78#return; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,223 INFO L272 TraceCheckUtils]: 26: Hoare triple {27617#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {27617#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {27672#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27617#(< ~counter~0 16)} is VALID [2022-04-28 06:48:01,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {27672#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,224 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27083#true} {27672#(< ~counter~0 15)} #82#return; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L272 TraceCheckUtils]: 18: Hoare triple {27672#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27083#true} {27672#(< ~counter~0 15)} #80#return; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L272 TraceCheckUtils]: 13: Hoare triple {27672#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,225 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27083#true} {27672#(< ~counter~0 15)} #78#return; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {27083#true} assume true; {27083#true} is VALID [2022-04-28 06:48:01,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {27083#true} assume !(0 == ~cond); {27083#true} is VALID [2022-04-28 06:48:01,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {27083#true} ~cond := #in~cond; {27083#true} is VALID [2022-04-28 06:48:01,226 INFO L272 TraceCheckUtils]: 8: Hoare triple {27672#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27083#true} is VALID [2022-04-28 06:48:01,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {27672#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {27727#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27672#(< ~counter~0 15)} is VALID [2022-04-28 06:48:01,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {27727#(< ~counter~0 14)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27727#(< ~counter~0 14)} is VALID [2022-04-28 06:48:01,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {27727#(< ~counter~0 14)} call #t~ret7 := main(); {27727#(< ~counter~0 14)} is VALID [2022-04-28 06:48:01,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27727#(< ~counter~0 14)} {27083#true} #92#return; {27727#(< ~counter~0 14)} is VALID [2022-04-28 06:48:01,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {27727#(< ~counter~0 14)} assume true; {27727#(< ~counter~0 14)} is VALID [2022-04-28 06:48:01,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {27083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27727#(< ~counter~0 14)} is VALID [2022-04-28 06:48:01,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {27083#true} call ULTIMATE.init(); {27083#true} is VALID [2022-04-28 06:48:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 06:48:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912536162] [2022-04-28 06:48:01,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294130777] [2022-04-28 06:48:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294130777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:01,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:01,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 06:48:01,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993027867] [2022-04-28 06:48:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993027867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:01,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:01,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:48:01,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167449711] [2022-04-28 06:48:01,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 06:48:01,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:01,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 06:48:01,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:48:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:48:01,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:48:01,304 INFO L87 Difference]: Start difference. First operand 253 states and 285 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 06:48:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:02,276 INFO L93 Difference]: Finished difference Result 329 states and 371 transitions. [2022-04-28 06:48:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 06:48:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 06:48:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 06:48:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 06:48:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 06:48:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 06:48:02,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2022-04-28 06:48:02,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:02,413 INFO L225 Difference]: With dead ends: 329 [2022-04-28 06:48:02,413 INFO L226 Difference]: Without dead ends: 316 [2022-04-28 06:48:02,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=253, Unknown=0, NotChecked=0, Total=420 [2022-04-28 06:48:02,413 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:02,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 206 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:48:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-28 06:48:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2022-04-28 06:48:02,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:02,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:02,844 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:02,844 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:02,848 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2022-04-28 06:48:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2022-04-28 06:48:02,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:02,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:02,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 316 states. [2022-04-28 06:48:02,850 INFO L87 Difference]: Start difference. First operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 316 states. [2022-04-28 06:48:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:02,854 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2022-04-28 06:48:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2022-04-28 06:48:02,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:02,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:02,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:02,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 350 transitions. [2022-04-28 06:48:02,860 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 350 transitions. Word has length 108 [2022-04-28 06:48:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:02,860 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 350 transitions. [2022-04-28 06:48:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 06:48:02,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 350 transitions. [2022-04-28 06:48:03,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 350 transitions. [2022-04-28 06:48:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 06:48:03,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:03,515 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:03,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:03,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 06:48:03,716 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 1 times [2022-04-28 06:48:03,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:03,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637528500] [2022-04-28 06:48:07,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:07,082 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:07,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 2 times [2022-04-28 06:48:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:07,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941301355] [2022-04-28 06:48:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:07,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581335895] [2022-04-28 06:48:07,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:48:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:07,092 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:07,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 06:48:07,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:48:07,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:07,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 06:48:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:07,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:07,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {29674#true} call ULTIMATE.init(); {29674#true} is VALID [2022-04-28 06:48:07,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {29674#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29682#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:07,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {29682#(<= ~counter~0 0)} assume true; {29682#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:07,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29682#(<= ~counter~0 0)} {29674#true} #92#return; {29682#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:07,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {29682#(<= ~counter~0 0)} call #t~ret7 := main(); {29682#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:07,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {29682#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {29682#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:07,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {29682#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {29698#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,615 INFO L272 TraceCheckUtils]: 8: Hoare triple {29698#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {29698#(<= ~counter~0 1)} ~cond := #in~cond; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {29698#(<= ~counter~0 1)} assume !(0 == ~cond); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {29698#(<= ~counter~0 1)} assume true; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29698#(<= ~counter~0 1)} {29698#(<= ~counter~0 1)} #78#return; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {29698#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {29698#(<= ~counter~0 1)} ~cond := #in~cond; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {29698#(<= ~counter~0 1)} assume !(0 == ~cond); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {29698#(<= ~counter~0 1)} assume true; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29698#(<= ~counter~0 1)} {29698#(<= ~counter~0 1)} #80#return; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,618 INFO L272 TraceCheckUtils]: 18: Hoare triple {29698#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {29698#(<= ~counter~0 1)} ~cond := #in~cond; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {29698#(<= ~counter~0 1)} assume !(0 == ~cond); {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {29698#(<= ~counter~0 1)} assume true; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,619 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29698#(<= ~counter~0 1)} {29698#(<= ~counter~0 1)} #82#return; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {29698#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29698#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:07,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {29698#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {29753#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {29753#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {29753#(<= ~counter~0 2)} ~cond := #in~cond; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {29753#(<= ~counter~0 2)} assume !(0 == ~cond); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {29753#(<= ~counter~0 2)} assume true; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,622 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29753#(<= ~counter~0 2)} {29753#(<= ~counter~0 2)} #78#return; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,622 INFO L272 TraceCheckUtils]: 31: Hoare triple {29753#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {29753#(<= ~counter~0 2)} ~cond := #in~cond; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {29753#(<= ~counter~0 2)} assume !(0 == ~cond); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {29753#(<= ~counter~0 2)} assume true; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,623 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29753#(<= ~counter~0 2)} {29753#(<= ~counter~0 2)} #80#return; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,624 INFO L272 TraceCheckUtils]: 36: Hoare triple {29753#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {29753#(<= ~counter~0 2)} ~cond := #in~cond; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {29753#(<= ~counter~0 2)} assume !(0 == ~cond); {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {29753#(<= ~counter~0 2)} assume true; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,625 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29753#(<= ~counter~0 2)} {29753#(<= ~counter~0 2)} #82#return; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {29753#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29753#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:07,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {29753#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {29808#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,627 INFO L272 TraceCheckUtils]: 44: Hoare triple {29808#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {29808#(<= ~counter~0 3)} ~cond := #in~cond; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {29808#(<= ~counter~0 3)} assume !(0 == ~cond); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {29808#(<= ~counter~0 3)} assume true; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,628 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29808#(<= ~counter~0 3)} {29808#(<= ~counter~0 3)} #78#return; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,628 INFO L272 TraceCheckUtils]: 49: Hoare triple {29808#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {29808#(<= ~counter~0 3)} ~cond := #in~cond; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {29808#(<= ~counter~0 3)} assume !(0 == ~cond); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {29808#(<= ~counter~0 3)} assume true; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,629 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29808#(<= ~counter~0 3)} {29808#(<= ~counter~0 3)} #80#return; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,630 INFO L272 TraceCheckUtils]: 54: Hoare triple {29808#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {29808#(<= ~counter~0 3)} ~cond := #in~cond; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {29808#(<= ~counter~0 3)} assume !(0 == ~cond); {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {29808#(<= ~counter~0 3)} assume true; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,631 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29808#(<= ~counter~0 3)} {29808#(<= ~counter~0 3)} #82#return; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {29808#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29808#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:07,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {29808#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {29863#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,632 INFO L272 TraceCheckUtils]: 62: Hoare triple {29863#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {29863#(<= ~counter~0 4)} ~cond := #in~cond; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {29863#(<= ~counter~0 4)} assume !(0 == ~cond); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {29863#(<= ~counter~0 4)} assume true; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,633 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29863#(<= ~counter~0 4)} {29863#(<= ~counter~0 4)} #78#return; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,634 INFO L272 TraceCheckUtils]: 67: Hoare triple {29863#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {29863#(<= ~counter~0 4)} ~cond := #in~cond; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,634 INFO L290 TraceCheckUtils]: 69: Hoare triple {29863#(<= ~counter~0 4)} assume !(0 == ~cond); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {29863#(<= ~counter~0 4)} assume true; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,635 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29863#(<= ~counter~0 4)} {29863#(<= ~counter~0 4)} #80#return; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,635 INFO L272 TraceCheckUtils]: 72: Hoare triple {29863#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {29863#(<= ~counter~0 4)} ~cond := #in~cond; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,636 INFO L290 TraceCheckUtils]: 74: Hoare triple {29863#(<= ~counter~0 4)} assume !(0 == ~cond); {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,636 INFO L290 TraceCheckUtils]: 75: Hoare triple {29863#(<= ~counter~0 4)} assume true; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,636 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29863#(<= ~counter~0 4)} {29863#(<= ~counter~0 4)} #82#return; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {29863#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29863#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:07,637 INFO L290 TraceCheckUtils]: 78: Hoare triple {29863#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {29918#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,638 INFO L272 TraceCheckUtils]: 80: Hoare triple {29918#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {29918#(<= ~counter~0 5)} ~cond := #in~cond; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {29918#(<= ~counter~0 5)} assume !(0 == ~cond); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,639 INFO L290 TraceCheckUtils]: 83: Hoare triple {29918#(<= ~counter~0 5)} assume true; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,639 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29918#(<= ~counter~0 5)} {29918#(<= ~counter~0 5)} #78#return; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,639 INFO L272 TraceCheckUtils]: 85: Hoare triple {29918#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {29918#(<= ~counter~0 5)} ~cond := #in~cond; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {29918#(<= ~counter~0 5)} assume !(0 == ~cond); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,640 INFO L290 TraceCheckUtils]: 88: Hoare triple {29918#(<= ~counter~0 5)} assume true; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,640 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29918#(<= ~counter~0 5)} {29918#(<= ~counter~0 5)} #80#return; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,641 INFO L272 TraceCheckUtils]: 90: Hoare triple {29918#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,641 INFO L290 TraceCheckUtils]: 91: Hoare triple {29918#(<= ~counter~0 5)} ~cond := #in~cond; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,641 INFO L290 TraceCheckUtils]: 92: Hoare triple {29918#(<= ~counter~0 5)} assume !(0 == ~cond); {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,641 INFO L290 TraceCheckUtils]: 93: Hoare triple {29918#(<= ~counter~0 5)} assume true; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,642 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29918#(<= ~counter~0 5)} {29918#(<= ~counter~0 5)} #82#return; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,642 INFO L290 TraceCheckUtils]: 95: Hoare triple {29918#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29918#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:07,642 INFO L290 TraceCheckUtils]: 96: Hoare triple {29918#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29973#(<= |main_#t~post5| 5)} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 97: Hoare triple {29973#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 98: Hoare triple {29675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 99: Hoare triple {29675#false} assume !!(#t~post6 < 20);havoc #t~post6; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L272 TraceCheckUtils]: 100: Hoare triple {29675#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {29675#false} ~cond := #in~cond; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {29675#false} assume !(0 == ~cond); {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 103: Hoare triple {29675#false} assume true; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29675#false} {29675#false} #84#return; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L272 TraceCheckUtils]: 105: Hoare triple {29675#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 106: Hoare triple {29675#false} ~cond := #in~cond; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 107: Hoare triple {29675#false} assume !(0 == ~cond); {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 108: Hoare triple {29675#false} assume true; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29675#false} {29675#false} #86#return; {29675#false} is VALID [2022-04-28 06:48:07,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {29675#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 111: Hoare triple {29675#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 112: Hoare triple {29675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 113: Hoare triple {29675#false} assume !(#t~post6 < 20);havoc #t~post6; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L272 TraceCheckUtils]: 114: Hoare triple {29675#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 115: Hoare triple {29675#false} ~cond := #in~cond; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 116: Hoare triple {29675#false} assume 0 == ~cond; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L290 TraceCheckUtils]: 117: Hoare triple {29675#false} assume !false; {29675#false} is VALID [2022-04-28 06:48:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 150 proven. 430 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 06:48:07,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:08,086 INFO L290 TraceCheckUtils]: 117: Hoare triple {29675#false} assume !false; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {29675#false} assume 0 == ~cond; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 115: Hoare triple {29675#false} ~cond := #in~cond; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L272 TraceCheckUtils]: 114: Hoare triple {29675#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 113: Hoare triple {29675#false} assume !(#t~post6 < 20);havoc #t~post6; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 112: Hoare triple {29675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 111: Hoare triple {29675#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 110: Hoare triple {29675#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29674#true} {29675#false} #86#return; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 108: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 107: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 106: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L272 TraceCheckUtils]: 105: Hoare triple {29675#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29674#true} {29675#false} #84#return; {29675#false} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 103: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 102: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 101: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L272 TraceCheckUtils]: 100: Hoare triple {29675#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,087 INFO L290 TraceCheckUtils]: 99: Hoare triple {29675#false} assume !!(#t~post6 < 20);havoc #t~post6; {29675#false} is VALID [2022-04-28 06:48:08,088 INFO L290 TraceCheckUtils]: 98: Hoare triple {29675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29675#false} is VALID [2022-04-28 06:48:08,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {30097#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {29675#false} is VALID [2022-04-28 06:48:08,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {30101#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30097#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:48:08,088 INFO L290 TraceCheckUtils]: 95: Hoare triple {30101#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,089 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29674#true} {30101#(< ~counter~0 20)} #82#return; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,090 INFO L290 TraceCheckUtils]: 93: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,090 INFO L290 TraceCheckUtils]: 92: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,090 INFO L290 TraceCheckUtils]: 91: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,090 INFO L272 TraceCheckUtils]: 90: Hoare triple {30101#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,095 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29674#true} {30101#(< ~counter~0 20)} #80#return; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 88: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 87: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 86: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L272 TraceCheckUtils]: 85: Hoare triple {30101#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29674#true} {30101#(< ~counter~0 20)} #78#return; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 83: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 82: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,096 INFO L272 TraceCheckUtils]: 80: Hoare triple {30101#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {30101#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {30156#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30101#(< ~counter~0 20)} is VALID [2022-04-28 06:48:08,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {30156#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,099 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29674#true} {30156#(< ~counter~0 19)} #82#return; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,099 INFO L272 TraceCheckUtils]: 72: Hoare triple {30156#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,099 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29674#true} {30156#(< ~counter~0 19)} #80#return; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L290 TraceCheckUtils]: 69: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L272 TraceCheckUtils]: 67: Hoare triple {30156#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29674#true} {30156#(< ~counter~0 19)} #78#return; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L290 TraceCheckUtils]: 63: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,100 INFO L272 TraceCheckUtils]: 62: Hoare triple {30156#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {30156#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {30211#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30156#(< ~counter~0 19)} is VALID [2022-04-28 06:48:08,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {30211#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,102 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29674#true} {30211#(< ~counter~0 18)} #82#return; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,102 INFO L272 TraceCheckUtils]: 54: Hoare triple {30211#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,103 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29674#true} {30211#(< ~counter~0 18)} #80#return; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,103 INFO L272 TraceCheckUtils]: 49: Hoare triple {30211#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,103 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29674#true} {30211#(< ~counter~0 18)} #78#return; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,104 INFO L272 TraceCheckUtils]: 44: Hoare triple {30211#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {30211#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {30266#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30211#(< ~counter~0 18)} is VALID [2022-04-28 06:48:08,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {30266#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,106 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29674#true} {30266#(< ~counter~0 17)} #82#return; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L272 TraceCheckUtils]: 36: Hoare triple {30266#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29674#true} {30266#(< ~counter~0 17)} #80#return; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,106 INFO L272 TraceCheckUtils]: 31: Hoare triple {30266#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,107 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29674#true} {30266#(< ~counter~0 17)} #78#return; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,107 INFO L272 TraceCheckUtils]: 26: Hoare triple {30266#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {30266#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {30321#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30266#(< ~counter~0 17)} is VALID [2022-04-28 06:48:08,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {30321#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,109 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29674#true} {30321#(< ~counter~0 16)} #82#return; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L272 TraceCheckUtils]: 18: Hoare triple {30321#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29674#true} {30321#(< ~counter~0 16)} #80#return; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,109 INFO L272 TraceCheckUtils]: 13: Hoare triple {30321#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,110 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29674#true} {30321#(< ~counter~0 16)} #78#return; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {29674#true} assume true; {29674#true} is VALID [2022-04-28 06:48:08,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {29674#true} assume !(0 == ~cond); {29674#true} is VALID [2022-04-28 06:48:08,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {29674#true} ~cond := #in~cond; {29674#true} is VALID [2022-04-28 06:48:08,110 INFO L272 TraceCheckUtils]: 8: Hoare triple {30321#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29674#true} is VALID [2022-04-28 06:48:08,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {30321#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {30376#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30321#(< ~counter~0 16)} is VALID [2022-04-28 06:48:08,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {30376#(< ~counter~0 15)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {30376#(< ~counter~0 15)} is VALID [2022-04-28 06:48:08,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {30376#(< ~counter~0 15)} call #t~ret7 := main(); {30376#(< ~counter~0 15)} is VALID [2022-04-28 06:48:08,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30376#(< ~counter~0 15)} {29674#true} #92#return; {30376#(< ~counter~0 15)} is VALID [2022-04-28 06:48:08,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {30376#(< ~counter~0 15)} assume true; {30376#(< ~counter~0 15)} is VALID [2022-04-28 06:48:08,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {29674#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30376#(< ~counter~0 15)} is VALID [2022-04-28 06:48:08,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {29674#true} call ULTIMATE.init(); {29674#true} is VALID [2022-04-28 06:48:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-04-28 06:48:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:08,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941301355] [2022-04-28 06:48:08,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:08,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581335895] [2022-04-28 06:48:08,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581335895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:08,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:08,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 06:48:08,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:08,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637528500] [2022-04-28 06:48:08,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637528500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:08,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:08,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:48:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638502661] [2022-04-28 06:48:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 06:48:08,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:08,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 06:48:08,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:08,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:48:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:08,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:48:08,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:48:08,175 INFO L87 Difference]: Start difference. First operand 315 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 06:48:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:08,923 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2022-04-28 06:48:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 06:48:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 06:48:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 06:48:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 06:48:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 06:48:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 06:48:08,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-04-28 06:48:09,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:09,034 INFO L225 Difference]: With dead ends: 368 [2022-04-28 06:48:09,034 INFO L226 Difference]: Without dead ends: 313 [2022-04-28 06:48:09,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 06:48:09,035 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:09,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:48:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-28 06:48:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-04-28 06:48:09,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:09,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:09,428 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:09,428 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:09,432 INFO L93 Difference]: Finished difference Result 313 states and 347 transitions. [2022-04-28 06:48:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 06:48:09,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:09,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:09,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 313 states. [2022-04-28 06:48:09,433 INFO L87 Difference]: Start difference. First operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 313 states. [2022-04-28 06:48:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:09,437 INFO L93 Difference]: Finished difference Result 313 states and 347 transitions. [2022-04-28 06:48:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 06:48:09,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:09,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:09,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:09,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 06:48:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 347 transitions. [2022-04-28 06:48:09,443 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 347 transitions. Word has length 118 [2022-04-28 06:48:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:09,443 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 347 transitions. [2022-04-28 06:48:09,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 06:48:09,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 347 transitions. [2022-04-28 06:48:10,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 06:48:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 06:48:10,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:10,102 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:10,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:10,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 06:48:10,302 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 9 times [2022-04-28 06:48:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:10,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136918603] [2022-04-28 06:48:12,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:12,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:12,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 10 times [2022-04-28 06:48:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:12,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138713480] [2022-04-28 06:48:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:12,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322572828] [2022-04-28 06:48:12,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:48:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:12,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:12,987 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:12,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 06:48:13,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:48:13,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:13,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 06:48:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:13,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:13,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {32395#true} call ULTIMATE.init(); {32395#true} is VALID [2022-04-28 06:48:13,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {32395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32403#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:13,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {32403#(<= ~counter~0 0)} assume true; {32403#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:13,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32403#(<= ~counter~0 0)} {32395#true} #92#return; {32403#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:13,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {32403#(<= ~counter~0 0)} call #t~ret7 := main(); {32403#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:13,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {32403#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {32403#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:13,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {32403#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {32419#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,677 INFO L272 TraceCheckUtils]: 8: Hoare triple {32419#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {32419#(<= ~counter~0 1)} ~cond := #in~cond; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {32419#(<= ~counter~0 1)} assume !(0 == ~cond); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {32419#(<= ~counter~0 1)} assume true; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,678 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32419#(<= ~counter~0 1)} {32419#(<= ~counter~0 1)} #78#return; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {32419#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {32419#(<= ~counter~0 1)} ~cond := #in~cond; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {32419#(<= ~counter~0 1)} assume !(0 == ~cond); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {32419#(<= ~counter~0 1)} assume true; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,680 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32419#(<= ~counter~0 1)} {32419#(<= ~counter~0 1)} #80#return; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,680 INFO L272 TraceCheckUtils]: 18: Hoare triple {32419#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {32419#(<= ~counter~0 1)} ~cond := #in~cond; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {32419#(<= ~counter~0 1)} assume !(0 == ~cond); {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {32419#(<= ~counter~0 1)} assume true; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,681 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32419#(<= ~counter~0 1)} {32419#(<= ~counter~0 1)} #82#return; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {32419#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32419#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:13,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {32419#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {32474#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,683 INFO L272 TraceCheckUtils]: 26: Hoare triple {32474#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {32474#(<= ~counter~0 2)} ~cond := #in~cond; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {32474#(<= ~counter~0 2)} assume !(0 == ~cond); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {32474#(<= ~counter~0 2)} assume true; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,684 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32474#(<= ~counter~0 2)} {32474#(<= ~counter~0 2)} #78#return; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,684 INFO L272 TraceCheckUtils]: 31: Hoare triple {32474#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {32474#(<= ~counter~0 2)} ~cond := #in~cond; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {32474#(<= ~counter~0 2)} assume !(0 == ~cond); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {32474#(<= ~counter~0 2)} assume true; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,685 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32474#(<= ~counter~0 2)} {32474#(<= ~counter~0 2)} #80#return; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,685 INFO L272 TraceCheckUtils]: 36: Hoare triple {32474#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {32474#(<= ~counter~0 2)} ~cond := #in~cond; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {32474#(<= ~counter~0 2)} assume !(0 == ~cond); {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {32474#(<= ~counter~0 2)} assume true; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,686 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32474#(<= ~counter~0 2)} {32474#(<= ~counter~0 2)} #82#return; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {32474#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32474#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:13,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {32474#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {32529#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,688 INFO L272 TraceCheckUtils]: 44: Hoare triple {32529#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {32529#(<= ~counter~0 3)} ~cond := #in~cond; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {32529#(<= ~counter~0 3)} assume !(0 == ~cond); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {32529#(<= ~counter~0 3)} assume true; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,689 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32529#(<= ~counter~0 3)} {32529#(<= ~counter~0 3)} #78#return; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,690 INFO L272 TraceCheckUtils]: 49: Hoare triple {32529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {32529#(<= ~counter~0 3)} ~cond := #in~cond; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {32529#(<= ~counter~0 3)} assume !(0 == ~cond); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {32529#(<= ~counter~0 3)} assume true; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,691 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32529#(<= ~counter~0 3)} {32529#(<= ~counter~0 3)} #80#return; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,691 INFO L272 TraceCheckUtils]: 54: Hoare triple {32529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {32529#(<= ~counter~0 3)} ~cond := #in~cond; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {32529#(<= ~counter~0 3)} assume !(0 == ~cond); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {32529#(<= ~counter~0 3)} assume true; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,692 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32529#(<= ~counter~0 3)} {32529#(<= ~counter~0 3)} #82#return; {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {32529#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {32529#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:13,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {32529#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {32584#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,694 INFO L272 TraceCheckUtils]: 62: Hoare triple {32584#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {32584#(<= ~counter~0 4)} ~cond := #in~cond; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {32584#(<= ~counter~0 4)} assume !(0 == ~cond); {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {32584#(<= ~counter~0 4)} assume true; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,695 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32584#(<= ~counter~0 4)} {32584#(<= ~counter~0 4)} #84#return; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,695 INFO L272 TraceCheckUtils]: 67: Hoare triple {32584#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {32584#(<= ~counter~0 4)} ~cond := #in~cond; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {32584#(<= ~counter~0 4)} assume !(0 == ~cond); {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {32584#(<= ~counter~0 4)} assume true; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,697 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32584#(<= ~counter~0 4)} {32584#(<= ~counter~0 4)} #86#return; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {32584#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {32584#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32584#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:13,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {32584#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,698 INFO L290 TraceCheckUtils]: 75: Hoare triple {32627#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,699 INFO L272 TraceCheckUtils]: 76: Hoare triple {32627#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {32627#(<= ~counter~0 5)} ~cond := #in~cond; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {32627#(<= ~counter~0 5)} assume !(0 == ~cond); {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {32627#(<= ~counter~0 5)} assume true; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,700 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32627#(<= ~counter~0 5)} {32627#(<= ~counter~0 5)} #84#return; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,700 INFO L272 TraceCheckUtils]: 81: Hoare triple {32627#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,700 INFO L290 TraceCheckUtils]: 82: Hoare triple {32627#(<= ~counter~0 5)} ~cond := #in~cond; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {32627#(<= ~counter~0 5)} assume !(0 == ~cond); {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {32627#(<= ~counter~0 5)} assume true; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,701 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32627#(<= ~counter~0 5)} {32627#(<= ~counter~0 5)} #86#return; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {32627#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,702 INFO L290 TraceCheckUtils]: 87: Hoare triple {32627#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32627#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:13,702 INFO L290 TraceCheckUtils]: 88: Hoare triple {32627#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,703 INFO L290 TraceCheckUtils]: 89: Hoare triple {32670#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,703 INFO L272 TraceCheckUtils]: 90: Hoare triple {32670#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,703 INFO L290 TraceCheckUtils]: 91: Hoare triple {32670#(<= ~counter~0 6)} ~cond := #in~cond; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {32670#(<= ~counter~0 6)} assume !(0 == ~cond); {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {32670#(<= ~counter~0 6)} assume true; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,704 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32670#(<= ~counter~0 6)} {32670#(<= ~counter~0 6)} #84#return; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,705 INFO L272 TraceCheckUtils]: 95: Hoare triple {32670#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {32670#(<= ~counter~0 6)} ~cond := #in~cond; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,705 INFO L290 TraceCheckUtils]: 97: Hoare triple {32670#(<= ~counter~0 6)} assume !(0 == ~cond); {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,705 INFO L290 TraceCheckUtils]: 98: Hoare triple {32670#(<= ~counter~0 6)} assume true; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,706 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32670#(<= ~counter~0 6)} {32670#(<= ~counter~0 6)} #86#return; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,706 INFO L290 TraceCheckUtils]: 100: Hoare triple {32670#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,706 INFO L290 TraceCheckUtils]: 101: Hoare triple {32670#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32670#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:13,707 INFO L290 TraceCheckUtils]: 102: Hoare triple {32670#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,707 INFO L290 TraceCheckUtils]: 103: Hoare triple {32713#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,708 INFO L272 TraceCheckUtils]: 104: Hoare triple {32713#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,708 INFO L290 TraceCheckUtils]: 105: Hoare triple {32713#(<= ~counter~0 7)} ~cond := #in~cond; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,708 INFO L290 TraceCheckUtils]: 106: Hoare triple {32713#(<= ~counter~0 7)} assume !(0 == ~cond); {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {32713#(<= ~counter~0 7)} assume true; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,709 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32713#(<= ~counter~0 7)} {32713#(<= ~counter~0 7)} #84#return; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,709 INFO L272 TraceCheckUtils]: 109: Hoare triple {32713#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,709 INFO L290 TraceCheckUtils]: 110: Hoare triple {32713#(<= ~counter~0 7)} ~cond := #in~cond; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {32713#(<= ~counter~0 7)} assume !(0 == ~cond); {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {32713#(<= ~counter~0 7)} assume true; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,710 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32713#(<= ~counter~0 7)} {32713#(<= ~counter~0 7)} #86#return; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,711 INFO L290 TraceCheckUtils]: 114: Hoare triple {32713#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,711 INFO L290 TraceCheckUtils]: 115: Hoare triple {32713#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32713#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:13,711 INFO L290 TraceCheckUtils]: 116: Hoare triple {32713#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32756#(<= |main_#t~post6| 7)} is VALID [2022-04-28 06:48:13,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {32756#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {32396#false} is VALID [2022-04-28 06:48:13,712 INFO L272 TraceCheckUtils]: 118: Hoare triple {32396#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32396#false} is VALID [2022-04-28 06:48:13,712 INFO L290 TraceCheckUtils]: 119: Hoare triple {32396#false} ~cond := #in~cond; {32396#false} is VALID [2022-04-28 06:48:13,712 INFO L290 TraceCheckUtils]: 120: Hoare triple {32396#false} assume 0 == ~cond; {32396#false} is VALID [2022-04-28 06:48:13,712 INFO L290 TraceCheckUtils]: 121: Hoare triple {32396#false} assume !false; {32396#false} is VALID [2022-04-28 06:48:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 554 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 06:48:13,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:14,224 INFO L290 TraceCheckUtils]: 121: Hoare triple {32396#false} assume !false; {32396#false} is VALID [2022-04-28 06:48:14,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {32396#false} assume 0 == ~cond; {32396#false} is VALID [2022-04-28 06:48:14,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {32396#false} ~cond := #in~cond; {32396#false} is VALID [2022-04-28 06:48:14,224 INFO L272 TraceCheckUtils]: 118: Hoare triple {32396#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32396#false} is VALID [2022-04-28 06:48:14,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {32784#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {32396#false} is VALID [2022-04-28 06:48:14,225 INFO L290 TraceCheckUtils]: 116: Hoare triple {32788#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32784#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:48:14,225 INFO L290 TraceCheckUtils]: 115: Hoare triple {32788#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,226 INFO L290 TraceCheckUtils]: 114: Hoare triple {32788#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,226 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32395#true} {32788#(< ~counter~0 20)} #86#return; {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,226 INFO L290 TraceCheckUtils]: 112: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,226 INFO L290 TraceCheckUtils]: 111: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,226 INFO L290 TraceCheckUtils]: 110: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,226 INFO L272 TraceCheckUtils]: 109: Hoare triple {32788#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,227 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32395#true} {32788#(< ~counter~0 20)} #84#return; {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,227 INFO L290 TraceCheckUtils]: 107: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,227 INFO L272 TraceCheckUtils]: 104: Hoare triple {32788#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {32788#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {32831#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32788#(< ~counter~0 20)} is VALID [2022-04-28 06:48:14,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {32831#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,230 INFO L290 TraceCheckUtils]: 100: Hoare triple {32831#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,230 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32395#true} {32831#(< ~counter~0 19)} #86#return; {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L272 TraceCheckUtils]: 95: Hoare triple {32831#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32395#true} {32831#(< ~counter~0 19)} #84#return; {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L290 TraceCheckUtils]: 91: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L272 TraceCheckUtils]: 90: Hoare triple {32831#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,231 INFO L290 TraceCheckUtils]: 89: Hoare triple {32831#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {32874#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32831#(< ~counter~0 19)} is VALID [2022-04-28 06:48:14,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {32874#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {32874#(< ~counter~0 18)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,233 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32395#true} {32874#(< ~counter~0 18)} #86#return; {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,233 INFO L290 TraceCheckUtils]: 83: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,233 INFO L290 TraceCheckUtils]: 82: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,233 INFO L272 TraceCheckUtils]: 81: Hoare triple {32874#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,234 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32395#true} {32874#(< ~counter~0 18)} #84#return; {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,234 INFO L272 TraceCheckUtils]: 76: Hoare triple {32874#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {32874#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {32917#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32874#(< ~counter~0 18)} is VALID [2022-04-28 06:48:14,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {32917#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {32917#(< ~counter~0 17)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,236 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32395#true} {32917#(< ~counter~0 17)} #86#return; {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L272 TraceCheckUtils]: 67: Hoare triple {32917#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32395#true} {32917#(< ~counter~0 17)} #84#return; {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,236 INFO L272 TraceCheckUtils]: 62: Hoare triple {32917#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {32917#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {32960#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32917#(< ~counter~0 17)} is VALID [2022-04-28 06:48:14,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {32960#(< ~counter~0 16)} assume !(~r~0 >= ~d~0); {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,238 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32395#true} {32960#(< ~counter~0 16)} #82#return; {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,238 INFO L272 TraceCheckUtils]: 54: Hoare triple {32960#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,238 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32395#true} {32960#(< ~counter~0 16)} #80#return; {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L272 TraceCheckUtils]: 49: Hoare triple {32960#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32395#true} {32960#(< ~counter~0 16)} #78#return; {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L272 TraceCheckUtils]: 44: Hoare triple {32960#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {32960#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {33015#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32960#(< ~counter~0 16)} is VALID [2022-04-28 06:48:14,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {33015#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,241 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32395#true} {33015#(< ~counter~0 15)} #82#return; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L272 TraceCheckUtils]: 36: Hoare triple {33015#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32395#true} {33015#(< ~counter~0 15)} #80#return; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,241 INFO L272 TraceCheckUtils]: 31: Hoare triple {33015#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,242 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32395#true} {33015#(< ~counter~0 15)} #78#return; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,242 INFO L272 TraceCheckUtils]: 26: Hoare triple {33015#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {33015#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {33070#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33015#(< ~counter~0 15)} is VALID [2022-04-28 06:48:14,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {33070#(< ~counter~0 14)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,244 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32395#true} {33070#(< ~counter~0 14)} #82#return; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,244 INFO L272 TraceCheckUtils]: 18: Hoare triple {33070#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32395#true} {33070#(< ~counter~0 14)} #80#return; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L272 TraceCheckUtils]: 13: Hoare triple {33070#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32395#true} {33070#(< ~counter~0 14)} #78#return; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {32395#true} assume true; {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {32395#true} assume !(0 == ~cond); {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {32395#true} ~cond := #in~cond; {32395#true} is VALID [2022-04-28 06:48:14,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {33070#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32395#true} is VALID [2022-04-28 06:48:14,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {33070#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {33125#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33070#(< ~counter~0 14)} is VALID [2022-04-28 06:48:14,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {33125#(< ~counter~0 13)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {33125#(< ~counter~0 13)} is VALID [2022-04-28 06:48:14,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {33125#(< ~counter~0 13)} call #t~ret7 := main(); {33125#(< ~counter~0 13)} is VALID [2022-04-28 06:48:14,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33125#(< ~counter~0 13)} {32395#true} #92#return; {33125#(< ~counter~0 13)} is VALID [2022-04-28 06:48:14,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {33125#(< ~counter~0 13)} assume true; {33125#(< ~counter~0 13)} is VALID [2022-04-28 06:48:14,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {32395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33125#(< ~counter~0 13)} is VALID [2022-04-28 06:48:14,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {32395#true} call ULTIMATE.init(); {32395#true} is VALID [2022-04-28 06:48:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 62 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 06:48:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138713480] [2022-04-28 06:48:14,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322572828] [2022-04-28 06:48:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322572828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:14,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 06:48:14,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136918603] [2022-04-28 06:48:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136918603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:14,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:14,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 06:48:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357820951] [2022-04-28 06:48:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:14,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 06:48:14,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:14,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 06:48:14,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:14,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 06:48:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 06:48:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 06:48:14,334 INFO L87 Difference]: Start difference. First operand 313 states and 347 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 06:48:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:15,455 INFO L93 Difference]: Finished difference Result 407 states and 461 transitions. [2022-04-28 06:48:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 06:48:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 06:48:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 06:48:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 06:48:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 06:48:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 06:48:15,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-04-28 06:48:15,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:15,611 INFO L225 Difference]: With dead ends: 407 [2022-04-28 06:48:15,612 INFO L226 Difference]: Without dead ends: 394 [2022-04-28 06:48:15,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:48:15,613 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 66 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:15,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:48:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-28 06:48:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2022-04-28 06:48:16,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:16,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:16,116 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:16,116 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:16,126 INFO L93 Difference]: Finished difference Result 394 states and 440 transitions. [2022-04-28 06:48:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 440 transitions. [2022-04-28 06:48:16,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:16,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:16,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 394 states. [2022-04-28 06:48:16,128 INFO L87 Difference]: Start difference. First operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 394 states. [2022-04-28 06:48:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:16,134 INFO L93 Difference]: Finished difference Result 394 states and 440 transitions. [2022-04-28 06:48:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 440 transitions. [2022-04-28 06:48:16,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:16,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:16,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:16,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 439 transitions. [2022-04-28 06:48:16,142 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 439 transitions. Word has length 122 [2022-04-28 06:48:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:16,143 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 439 transitions. [2022-04-28 06:48:16,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 06:48:16,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 439 transitions. [2022-04-28 06:48:16,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 439 transitions. [2022-04-28 06:48:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 06:48:16,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:16,958 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:16,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:17,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:17,159 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 3 times [2022-04-28 06:48:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:17,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587102220] [2022-04-28 06:48:20,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:20,891 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:20,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 4 times [2022-04-28 06:48:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940731579] [2022-04-28 06:48:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:20,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:20,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001766540] [2022-04-28 06:48:20,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:48:20,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:20,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:20,902 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 06:48:20,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:48:20,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:20,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 06:48:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:20,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:21,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {35542#true} call ULTIMATE.init(); {35542#true} is VALID [2022-04-28 06:48:21,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {35542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35550#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:21,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {35550#(<= ~counter~0 0)} assume true; {35550#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:21,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35550#(<= ~counter~0 0)} {35542#true} #92#return; {35550#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:21,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {35550#(<= ~counter~0 0)} call #t~ret7 := main(); {35550#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:21,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {35550#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {35550#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:21,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {35550#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {35566#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,521 INFO L272 TraceCheckUtils]: 8: Hoare triple {35566#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {35566#(<= ~counter~0 1)} ~cond := #in~cond; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {35566#(<= ~counter~0 1)} assume !(0 == ~cond); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {35566#(<= ~counter~0 1)} assume true; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,522 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35566#(<= ~counter~0 1)} {35566#(<= ~counter~0 1)} #78#return; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,522 INFO L272 TraceCheckUtils]: 13: Hoare triple {35566#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {35566#(<= ~counter~0 1)} ~cond := #in~cond; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {35566#(<= ~counter~0 1)} assume !(0 == ~cond); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {35566#(<= ~counter~0 1)} assume true; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35566#(<= ~counter~0 1)} {35566#(<= ~counter~0 1)} #80#return; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,524 INFO L272 TraceCheckUtils]: 18: Hoare triple {35566#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(<= ~counter~0 1)} ~cond := #in~cond; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(<= ~counter~0 1)} assume !(0 == ~cond); {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {35566#(<= ~counter~0 1)} assume true; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,525 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35566#(<= ~counter~0 1)} {35566#(<= ~counter~0 1)} #82#return; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {35566#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35566#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:21,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {35566#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {35621#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,526 INFO L272 TraceCheckUtils]: 26: Hoare triple {35621#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {35621#(<= ~counter~0 2)} ~cond := #in~cond; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {35621#(<= ~counter~0 2)} assume !(0 == ~cond); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {35621#(<= ~counter~0 2)} assume true; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,527 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35621#(<= ~counter~0 2)} {35621#(<= ~counter~0 2)} #78#return; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,528 INFO L272 TraceCheckUtils]: 31: Hoare triple {35621#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {35621#(<= ~counter~0 2)} ~cond := #in~cond; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {35621#(<= ~counter~0 2)} assume !(0 == ~cond); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {35621#(<= ~counter~0 2)} assume true; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,529 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35621#(<= ~counter~0 2)} {35621#(<= ~counter~0 2)} #80#return; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,529 INFO L272 TraceCheckUtils]: 36: Hoare triple {35621#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {35621#(<= ~counter~0 2)} ~cond := #in~cond; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {35621#(<= ~counter~0 2)} assume !(0 == ~cond); {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {35621#(<= ~counter~0 2)} assume true; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,530 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35621#(<= ~counter~0 2)} {35621#(<= ~counter~0 2)} #82#return; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {35621#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35621#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:21,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {35621#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {35676#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,532 INFO L272 TraceCheckUtils]: 44: Hoare triple {35676#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {35676#(<= ~counter~0 3)} ~cond := #in~cond; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {35676#(<= ~counter~0 3)} assume !(0 == ~cond); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {35676#(<= ~counter~0 3)} assume true; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,539 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35676#(<= ~counter~0 3)} {35676#(<= ~counter~0 3)} #78#return; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,539 INFO L272 TraceCheckUtils]: 49: Hoare triple {35676#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {35676#(<= ~counter~0 3)} ~cond := #in~cond; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {35676#(<= ~counter~0 3)} assume !(0 == ~cond); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {35676#(<= ~counter~0 3)} assume true; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,541 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35676#(<= ~counter~0 3)} {35676#(<= ~counter~0 3)} #80#return; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,541 INFO L272 TraceCheckUtils]: 54: Hoare triple {35676#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {35676#(<= ~counter~0 3)} ~cond := #in~cond; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {35676#(<= ~counter~0 3)} assume !(0 == ~cond); {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {35676#(<= ~counter~0 3)} assume true; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,542 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35676#(<= ~counter~0 3)} {35676#(<= ~counter~0 3)} #82#return; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {35676#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35676#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:21,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {35676#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {35731#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,545 INFO L272 TraceCheckUtils]: 62: Hoare triple {35731#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {35731#(<= ~counter~0 4)} ~cond := #in~cond; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {35731#(<= ~counter~0 4)} assume !(0 == ~cond); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {35731#(<= ~counter~0 4)} assume true; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,546 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35731#(<= ~counter~0 4)} {35731#(<= ~counter~0 4)} #78#return; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,546 INFO L272 TraceCheckUtils]: 67: Hoare triple {35731#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {35731#(<= ~counter~0 4)} ~cond := #in~cond; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {35731#(<= ~counter~0 4)} assume !(0 == ~cond); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {35731#(<= ~counter~0 4)} assume true; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,548 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35731#(<= ~counter~0 4)} {35731#(<= ~counter~0 4)} #80#return; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,548 INFO L272 TraceCheckUtils]: 72: Hoare triple {35731#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {35731#(<= ~counter~0 4)} ~cond := #in~cond; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {35731#(<= ~counter~0 4)} assume !(0 == ~cond); {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {35731#(<= ~counter~0 4)} assume true; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,550 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35731#(<= ~counter~0 4)} {35731#(<= ~counter~0 4)} #82#return; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {35731#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35731#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:21,551 INFO L290 TraceCheckUtils]: 78: Hoare triple {35731#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,552 INFO L290 TraceCheckUtils]: 79: Hoare triple {35786#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,552 INFO L272 TraceCheckUtils]: 80: Hoare triple {35786#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,552 INFO L290 TraceCheckUtils]: 81: Hoare triple {35786#(<= ~counter~0 5)} ~cond := #in~cond; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {35786#(<= ~counter~0 5)} assume !(0 == ~cond); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {35786#(<= ~counter~0 5)} assume true; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,553 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35786#(<= ~counter~0 5)} {35786#(<= ~counter~0 5)} #78#return; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,554 INFO L272 TraceCheckUtils]: 85: Hoare triple {35786#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {35786#(<= ~counter~0 5)} ~cond := #in~cond; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,555 INFO L290 TraceCheckUtils]: 87: Hoare triple {35786#(<= ~counter~0 5)} assume !(0 == ~cond); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {35786#(<= ~counter~0 5)} assume true; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,555 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35786#(<= ~counter~0 5)} {35786#(<= ~counter~0 5)} #80#return; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,556 INFO L272 TraceCheckUtils]: 90: Hoare triple {35786#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,556 INFO L290 TraceCheckUtils]: 91: Hoare triple {35786#(<= ~counter~0 5)} ~cond := #in~cond; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,556 INFO L290 TraceCheckUtils]: 92: Hoare triple {35786#(<= ~counter~0 5)} assume !(0 == ~cond); {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {35786#(<= ~counter~0 5)} assume true; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,557 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35786#(<= ~counter~0 5)} {35786#(<= ~counter~0 5)} #82#return; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {35786#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35786#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:21,559 INFO L290 TraceCheckUtils]: 96: Hoare triple {35786#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {35841#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,559 INFO L272 TraceCheckUtils]: 98: Hoare triple {35841#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,560 INFO L290 TraceCheckUtils]: 99: Hoare triple {35841#(<= ~counter~0 6)} ~cond := #in~cond; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {35841#(<= ~counter~0 6)} assume !(0 == ~cond); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {35841#(<= ~counter~0 6)} assume true; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,561 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35841#(<= ~counter~0 6)} {35841#(<= ~counter~0 6)} #78#return; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,561 INFO L272 TraceCheckUtils]: 103: Hoare triple {35841#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,562 INFO L290 TraceCheckUtils]: 104: Hoare triple {35841#(<= ~counter~0 6)} ~cond := #in~cond; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,562 INFO L290 TraceCheckUtils]: 105: Hoare triple {35841#(<= ~counter~0 6)} assume !(0 == ~cond); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,563 INFO L290 TraceCheckUtils]: 106: Hoare triple {35841#(<= ~counter~0 6)} assume true; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,563 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35841#(<= ~counter~0 6)} {35841#(<= ~counter~0 6)} #80#return; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,564 INFO L272 TraceCheckUtils]: 108: Hoare triple {35841#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,564 INFO L290 TraceCheckUtils]: 109: Hoare triple {35841#(<= ~counter~0 6)} ~cond := #in~cond; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {35841#(<= ~counter~0 6)} assume !(0 == ~cond); {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,565 INFO L290 TraceCheckUtils]: 111: Hoare triple {35841#(<= ~counter~0 6)} assume true; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,565 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35841#(<= ~counter~0 6)} {35841#(<= ~counter~0 6)} #82#return; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,565 INFO L290 TraceCheckUtils]: 113: Hoare triple {35841#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35841#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:21,566 INFO L290 TraceCheckUtils]: 114: Hoare triple {35841#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35896#(<= |main_#t~post5| 6)} is VALID [2022-04-28 06:48:21,566 INFO L290 TraceCheckUtils]: 115: Hoare triple {35896#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {35543#false} is VALID [2022-04-28 06:48:21,566 INFO L290 TraceCheckUtils]: 116: Hoare triple {35543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35543#false} is VALID [2022-04-28 06:48:21,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {35543#false} assume !!(#t~post6 < 20);havoc #t~post6; {35543#false} is VALID [2022-04-28 06:48:21,566 INFO L272 TraceCheckUtils]: 118: Hoare triple {35543#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35543#false} is VALID [2022-04-28 06:48:21,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {35543#false} ~cond := #in~cond; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 120: Hoare triple {35543#false} assume !(0 == ~cond); {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 121: Hoare triple {35543#false} assume true; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35543#false} {35543#false} #84#return; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L272 TraceCheckUtils]: 123: Hoare triple {35543#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 124: Hoare triple {35543#false} ~cond := #in~cond; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 125: Hoare triple {35543#false} assume !(0 == ~cond); {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 126: Hoare triple {35543#false} assume true; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35543#false} {35543#false} #86#return; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 128: Hoare triple {35543#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 129: Hoare triple {35543#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 130: Hoare triple {35543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 131: Hoare triple {35543#false} assume !(#t~post6 < 20);havoc #t~post6; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L272 TraceCheckUtils]: 132: Hoare triple {35543#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 133: Hoare triple {35543#false} ~cond := #in~cond; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 134: Hoare triple {35543#false} assume 0 == ~cond; {35543#false} is VALID [2022-04-28 06:48:21,567 INFO L290 TraceCheckUtils]: 135: Hoare triple {35543#false} assume !false; {35543#false} is VALID [2022-04-28 06:48:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 180 proven. 642 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 06:48:21,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 135: Hoare triple {35543#false} assume !false; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 134: Hoare triple {35543#false} assume 0 == ~cond; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 133: Hoare triple {35543#false} ~cond := #in~cond; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L272 TraceCheckUtils]: 132: Hoare triple {35543#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 131: Hoare triple {35543#false} assume !(#t~post6 < 20);havoc #t~post6; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 130: Hoare triple {35543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 129: Hoare triple {35543#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 128: Hoare triple {35543#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35542#true} {35543#false} #86#return; {35543#false} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 126: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 125: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,091 INFO L290 TraceCheckUtils]: 124: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L272 TraceCheckUtils]: 123: Hoare triple {35543#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35542#true} {35543#false} #84#return; {35543#false} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 121: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 119: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L272 TraceCheckUtils]: 118: Hoare triple {35543#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {35543#false} assume !!(#t~post6 < 20);havoc #t~post6; {35543#false} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 116: Hoare triple {35543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35543#false} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 115: Hoare triple {36020#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {35543#false} is VALID [2022-04-28 06:48:22,092 INFO L290 TraceCheckUtils]: 114: Hoare triple {36024#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36020#(< |main_#t~post5| 20)} is VALID [2022-04-28 06:48:22,093 INFO L290 TraceCheckUtils]: 113: Hoare triple {36024#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,093 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35542#true} {36024#(< ~counter~0 20)} #82#return; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,093 INFO L290 TraceCheckUtils]: 111: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,093 INFO L272 TraceCheckUtils]: 108: Hoare triple {36024#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35542#true} {36024#(< ~counter~0 20)} #80#return; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 106: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 105: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 104: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L272 TraceCheckUtils]: 103: Hoare triple {36024#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35542#true} {36024#(< ~counter~0 20)} #78#return; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L290 TraceCheckUtils]: 99: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,094 INFO L272 TraceCheckUtils]: 98: Hoare triple {36024#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,095 INFO L290 TraceCheckUtils]: 97: Hoare triple {36024#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {36079#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36024#(< ~counter~0 20)} is VALID [2022-04-28 06:48:22,096 INFO L290 TraceCheckUtils]: 95: Hoare triple {36079#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,096 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35542#true} {36079#(< ~counter~0 19)} #82#return; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,096 INFO L290 TraceCheckUtils]: 93: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L290 TraceCheckUtils]: 91: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L272 TraceCheckUtils]: 90: Hoare triple {36079#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35542#true} {36079#(< ~counter~0 19)} #80#return; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,097 INFO L290 TraceCheckUtils]: 88: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L290 TraceCheckUtils]: 87: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,097 INFO L272 TraceCheckUtils]: 85: Hoare triple {36079#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,098 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35542#true} {36079#(< ~counter~0 19)} #78#return; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,098 INFO L272 TraceCheckUtils]: 80: Hoare triple {36079#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {36079#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {36134#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36079#(< ~counter~0 19)} is VALID [2022-04-28 06:48:22,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {36134#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,099 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35542#true} {36134#(< ~counter~0 18)} #82#return; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,099 INFO L272 TraceCheckUtils]: 72: Hoare triple {36134#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35542#true} {36134#(< ~counter~0 18)} #80#return; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L290 TraceCheckUtils]: 69: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L272 TraceCheckUtils]: 67: Hoare triple {36134#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35542#true} {36134#(< ~counter~0 18)} #78#return; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,101 INFO L272 TraceCheckUtils]: 62: Hoare triple {36134#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {36134#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {36189#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36134#(< ~counter~0 18)} is VALID [2022-04-28 06:48:22,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {36189#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,102 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35542#true} {36189#(< ~counter~0 17)} #82#return; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L272 TraceCheckUtils]: 54: Hoare triple {36189#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35542#true} {36189#(< ~counter~0 17)} #80#return; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L272 TraceCheckUtils]: 49: Hoare triple {36189#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,103 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35542#true} {36189#(< ~counter~0 17)} #78#return; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,104 INFO L272 TraceCheckUtils]: 44: Hoare triple {36189#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {36189#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {36244#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36189#(< ~counter~0 17)} is VALID [2022-04-28 06:48:22,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {36244#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,105 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35542#true} {36244#(< ~counter~0 16)} #82#return; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L272 TraceCheckUtils]: 36: Hoare triple {36244#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35542#true} {36244#(< ~counter~0 16)} #80#return; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L272 TraceCheckUtils]: 31: Hoare triple {36244#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,106 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35542#true} {36244#(< ~counter~0 16)} #78#return; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,107 INFO L272 TraceCheckUtils]: 26: Hoare triple {36244#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {36244#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {36299#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36244#(< ~counter~0 16)} is VALID [2022-04-28 06:48:22,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {36299#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,118 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35542#true} {36299#(< ~counter~0 15)} #82#return; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L272 TraceCheckUtils]: 18: Hoare triple {36299#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35542#true} {36299#(< ~counter~0 15)} #80#return; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L272 TraceCheckUtils]: 13: Hoare triple {36299#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35542#true} {36299#(< ~counter~0 15)} #78#return; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {35542#true} assume true; {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {35542#true} assume !(0 == ~cond); {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {35542#true} ~cond := #in~cond; {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L272 TraceCheckUtils]: 8: Hoare triple {36299#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35542#true} is VALID [2022-04-28 06:48:22,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {36299#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {36354#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36299#(< ~counter~0 15)} is VALID [2022-04-28 06:48:22,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {36354#(< ~counter~0 14)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {36354#(< ~counter~0 14)} is VALID [2022-04-28 06:48:22,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {36354#(< ~counter~0 14)} call #t~ret7 := main(); {36354#(< ~counter~0 14)} is VALID [2022-04-28 06:48:22,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36354#(< ~counter~0 14)} {35542#true} #92#return; {36354#(< ~counter~0 14)} is VALID [2022-04-28 06:48:22,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {36354#(< ~counter~0 14)} assume true; {36354#(< ~counter~0 14)} is VALID [2022-04-28 06:48:22,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {35542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36354#(< ~counter~0 14)} is VALID [2022-04-28 06:48:22,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {35542#true} call ULTIMATE.init(); {35542#true} is VALID [2022-04-28 06:48:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 40 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2022-04-28 06:48:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:22,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940731579] [2022-04-28 06:48:22,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:22,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001766540] [2022-04-28 06:48:22,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001766540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:22,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:22,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 06:48:22,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:22,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587102220] [2022-04-28 06:48:22,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587102220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:22,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:22,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:48:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839594788] [2022-04-28 06:48:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:22,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 06:48:22,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:22,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 06:48:22,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:22,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:48:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:48:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:48:22,199 INFO L87 Difference]: Start difference. First operand 393 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 06:48:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:23,149 INFO L93 Difference]: Finished difference Result 446 states and 501 transitions. [2022-04-28 06:48:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 06:48:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 06:48:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 06:48:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 06:48:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 06:48:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 06:48:23,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 158 transitions. [2022-04-28 06:48:23,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:23,283 INFO L225 Difference]: With dead ends: 446 [2022-04-28 06:48:23,283 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 06:48:23,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:48:23,284 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:23,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 193 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:48:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 06:48:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2022-04-28 06:48:23,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:23,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:23,838 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:23,838 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:23,844 INFO L93 Difference]: Finished difference Result 391 states and 436 transitions. [2022-04-28 06:48:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 06:48:23,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:23,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:23,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 391 states. [2022-04-28 06:48:23,846 INFO L87 Difference]: Start difference. First operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 391 states. [2022-04-28 06:48:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:23,852 INFO L93 Difference]: Finished difference Result 391 states and 436 transitions. [2022-04-28 06:48:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 06:48:23,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:23,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:23,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:23,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 06:48:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 436 transitions. [2022-04-28 06:48:23,860 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 436 transitions. Word has length 136 [2022-04-28 06:48:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:23,860 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 436 transitions. [2022-04-28 06:48:23,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 06:48:23,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 436 transitions. [2022-04-28 06:48:24,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 06:48:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 06:48:24,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:24,709 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:24,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:24,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 06:48:24,909 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 11 times [2022-04-28 06:48:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:24,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094852751] [2022-04-28 06:48:28,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:28,995 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:28,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 12 times [2022-04-28 06:48:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:28,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903025528] [2022-04-28 06:48:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:29,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728259091] [2022-04-28 06:48:29,006 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:48:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:29,007 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:29,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 06:48:29,098 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 06:48:29,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:29,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 06:48:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:29,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:29,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {38843#true} call ULTIMATE.init(); {38843#true} is VALID [2022-04-28 06:48:29,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {38843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38851#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:29,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {38851#(<= ~counter~0 0)} assume true; {38851#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:29,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38851#(<= ~counter~0 0)} {38843#true} #92#return; {38851#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:29,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {38851#(<= ~counter~0 0)} call #t~ret7 := main(); {38851#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:29,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {38851#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {38851#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:29,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {38851#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {38867#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,708 INFO L272 TraceCheckUtils]: 8: Hoare triple {38867#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {38867#(<= ~counter~0 1)} ~cond := #in~cond; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {38867#(<= ~counter~0 1)} assume !(0 == ~cond); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {38867#(<= ~counter~0 1)} assume true; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,709 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38867#(<= ~counter~0 1)} {38867#(<= ~counter~0 1)} #78#return; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,709 INFO L272 TraceCheckUtils]: 13: Hoare triple {38867#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {38867#(<= ~counter~0 1)} ~cond := #in~cond; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {38867#(<= ~counter~0 1)} assume !(0 == ~cond); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {38867#(<= ~counter~0 1)} assume true; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,710 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38867#(<= ~counter~0 1)} {38867#(<= ~counter~0 1)} #80#return; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {38867#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {38867#(<= ~counter~0 1)} ~cond := #in~cond; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {38867#(<= ~counter~0 1)} assume !(0 == ~cond); {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {38867#(<= ~counter~0 1)} assume true; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,712 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38867#(<= ~counter~0 1)} {38867#(<= ~counter~0 1)} #82#return; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {38867#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38867#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:29,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {38867#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {38922#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,713 INFO L272 TraceCheckUtils]: 26: Hoare triple {38922#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {38922#(<= ~counter~0 2)} ~cond := #in~cond; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {38922#(<= ~counter~0 2)} assume !(0 == ~cond); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {38922#(<= ~counter~0 2)} assume true; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,714 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38922#(<= ~counter~0 2)} {38922#(<= ~counter~0 2)} #78#return; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,715 INFO L272 TraceCheckUtils]: 31: Hoare triple {38922#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {38922#(<= ~counter~0 2)} ~cond := #in~cond; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {38922#(<= ~counter~0 2)} assume !(0 == ~cond); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {38922#(<= ~counter~0 2)} assume true; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,716 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38922#(<= ~counter~0 2)} {38922#(<= ~counter~0 2)} #80#return; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,716 INFO L272 TraceCheckUtils]: 36: Hoare triple {38922#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {38922#(<= ~counter~0 2)} ~cond := #in~cond; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {38922#(<= ~counter~0 2)} assume !(0 == ~cond); {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {38922#(<= ~counter~0 2)} assume true; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,717 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38922#(<= ~counter~0 2)} {38922#(<= ~counter~0 2)} #82#return; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {38922#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38922#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:29,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {38922#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {38977#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,719 INFO L272 TraceCheckUtils]: 44: Hoare triple {38977#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {38977#(<= ~counter~0 3)} ~cond := #in~cond; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {38977#(<= ~counter~0 3)} assume !(0 == ~cond); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {38977#(<= ~counter~0 3)} assume true; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,720 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38977#(<= ~counter~0 3)} {38977#(<= ~counter~0 3)} #78#return; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,720 INFO L272 TraceCheckUtils]: 49: Hoare triple {38977#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {38977#(<= ~counter~0 3)} ~cond := #in~cond; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {38977#(<= ~counter~0 3)} assume !(0 == ~cond); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {38977#(<= ~counter~0 3)} assume true; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,721 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38977#(<= ~counter~0 3)} {38977#(<= ~counter~0 3)} #80#return; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,722 INFO L272 TraceCheckUtils]: 54: Hoare triple {38977#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {38977#(<= ~counter~0 3)} ~cond := #in~cond; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {38977#(<= ~counter~0 3)} assume !(0 == ~cond); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {38977#(<= ~counter~0 3)} assume true; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,723 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38977#(<= ~counter~0 3)} {38977#(<= ~counter~0 3)} #82#return; {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {38977#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {38977#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:29,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {38977#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {39032#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,725 INFO L272 TraceCheckUtils]: 62: Hoare triple {39032#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {39032#(<= ~counter~0 4)} ~cond := #in~cond; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {39032#(<= ~counter~0 4)} assume !(0 == ~cond); {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {39032#(<= ~counter~0 4)} assume true; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,726 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {39032#(<= ~counter~0 4)} {39032#(<= ~counter~0 4)} #84#return; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {39032#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {39032#(<= ~counter~0 4)} ~cond := #in~cond; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {39032#(<= ~counter~0 4)} assume !(0 == ~cond); {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {39032#(<= ~counter~0 4)} assume true; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,727 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39032#(<= ~counter~0 4)} {39032#(<= ~counter~0 4)} #86#return; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {39032#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {39032#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39032#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:29,728 INFO L290 TraceCheckUtils]: 74: Hoare triple {39032#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {39075#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,729 INFO L272 TraceCheckUtils]: 76: Hoare triple {39075#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {39075#(<= ~counter~0 5)} ~cond := #in~cond; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {39075#(<= ~counter~0 5)} assume !(0 == ~cond); {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {39075#(<= ~counter~0 5)} assume true; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,730 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {39075#(<= ~counter~0 5)} {39075#(<= ~counter~0 5)} #84#return; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,731 INFO L272 TraceCheckUtils]: 81: Hoare triple {39075#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {39075#(<= ~counter~0 5)} ~cond := #in~cond; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {39075#(<= ~counter~0 5)} assume !(0 == ~cond); {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {39075#(<= ~counter~0 5)} assume true; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,732 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {39075#(<= ~counter~0 5)} {39075#(<= ~counter~0 5)} #86#return; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {39075#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {39075#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39075#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:29,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {39075#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {39118#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,734 INFO L272 TraceCheckUtils]: 90: Hoare triple {39118#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,734 INFO L290 TraceCheckUtils]: 91: Hoare triple {39118#(<= ~counter~0 6)} ~cond := #in~cond; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,734 INFO L290 TraceCheckUtils]: 92: Hoare triple {39118#(<= ~counter~0 6)} assume !(0 == ~cond); {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,734 INFO L290 TraceCheckUtils]: 93: Hoare triple {39118#(<= ~counter~0 6)} assume true; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,735 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {39118#(<= ~counter~0 6)} {39118#(<= ~counter~0 6)} #84#return; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,735 INFO L272 TraceCheckUtils]: 95: Hoare triple {39118#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,735 INFO L290 TraceCheckUtils]: 96: Hoare triple {39118#(<= ~counter~0 6)} ~cond := #in~cond; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {39118#(<= ~counter~0 6)} assume !(0 == ~cond); {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {39118#(<= ~counter~0 6)} assume true; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,736 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {39118#(<= ~counter~0 6)} {39118#(<= ~counter~0 6)} #86#return; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {39118#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,737 INFO L290 TraceCheckUtils]: 101: Hoare triple {39118#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39118#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:29,738 INFO L290 TraceCheckUtils]: 102: Hoare triple {39118#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,738 INFO L290 TraceCheckUtils]: 103: Hoare triple {39161#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,738 INFO L272 TraceCheckUtils]: 104: Hoare triple {39161#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,738 INFO L290 TraceCheckUtils]: 105: Hoare triple {39161#(<= ~counter~0 7)} ~cond := #in~cond; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {39161#(<= ~counter~0 7)} assume !(0 == ~cond); {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {39161#(<= ~counter~0 7)} assume true; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,739 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {39161#(<= ~counter~0 7)} {39161#(<= ~counter~0 7)} #84#return; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,740 INFO L272 TraceCheckUtils]: 109: Hoare triple {39161#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,740 INFO L290 TraceCheckUtils]: 110: Hoare triple {39161#(<= ~counter~0 7)} ~cond := #in~cond; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,740 INFO L290 TraceCheckUtils]: 111: Hoare triple {39161#(<= ~counter~0 7)} assume !(0 == ~cond); {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,740 INFO L290 TraceCheckUtils]: 112: Hoare triple {39161#(<= ~counter~0 7)} assume true; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,741 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {39161#(<= ~counter~0 7)} {39161#(<= ~counter~0 7)} #86#return; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,741 INFO L290 TraceCheckUtils]: 114: Hoare triple {39161#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,741 INFO L290 TraceCheckUtils]: 115: Hoare triple {39161#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39161#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:29,742 INFO L290 TraceCheckUtils]: 116: Hoare triple {39161#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,742 INFO L290 TraceCheckUtils]: 117: Hoare triple {39204#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,743 INFO L272 TraceCheckUtils]: 118: Hoare triple {39204#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,743 INFO L290 TraceCheckUtils]: 119: Hoare triple {39204#(<= ~counter~0 8)} ~cond := #in~cond; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,743 INFO L290 TraceCheckUtils]: 120: Hoare triple {39204#(<= ~counter~0 8)} assume !(0 == ~cond); {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,743 INFO L290 TraceCheckUtils]: 121: Hoare triple {39204#(<= ~counter~0 8)} assume true; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,744 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {39204#(<= ~counter~0 8)} {39204#(<= ~counter~0 8)} #84#return; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,744 INFO L272 TraceCheckUtils]: 123: Hoare triple {39204#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,744 INFO L290 TraceCheckUtils]: 124: Hoare triple {39204#(<= ~counter~0 8)} ~cond := #in~cond; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,744 INFO L290 TraceCheckUtils]: 125: Hoare triple {39204#(<= ~counter~0 8)} assume !(0 == ~cond); {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,745 INFO L290 TraceCheckUtils]: 126: Hoare triple {39204#(<= ~counter~0 8)} assume true; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,745 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {39204#(<= ~counter~0 8)} {39204#(<= ~counter~0 8)} #86#return; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,745 INFO L290 TraceCheckUtils]: 128: Hoare triple {39204#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 129: Hoare triple {39204#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39204#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 130: Hoare triple {39204#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39247#(<= |main_#t~post6| 8)} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 131: Hoare triple {39247#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {38844#false} is VALID [2022-04-28 06:48:29,746 INFO L272 TraceCheckUtils]: 132: Hoare triple {38844#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38844#false} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 133: Hoare triple {38844#false} ~cond := #in~cond; {38844#false} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 134: Hoare triple {38844#false} assume 0 == ~cond; {38844#false} is VALID [2022-04-28 06:48:29,746 INFO L290 TraceCheckUtils]: 135: Hoare triple {38844#false} assume !false; {38844#false} is VALID [2022-04-28 06:48:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 716 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 06:48:29,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:30,329 INFO L290 TraceCheckUtils]: 135: Hoare triple {38844#false} assume !false; {38844#false} is VALID [2022-04-28 06:48:30,330 INFO L290 TraceCheckUtils]: 134: Hoare triple {38844#false} assume 0 == ~cond; {38844#false} is VALID [2022-04-28 06:48:30,330 INFO L290 TraceCheckUtils]: 133: Hoare triple {38844#false} ~cond := #in~cond; {38844#false} is VALID [2022-04-28 06:48:30,330 INFO L272 TraceCheckUtils]: 132: Hoare triple {38844#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38844#false} is VALID [2022-04-28 06:48:30,330 INFO L290 TraceCheckUtils]: 131: Hoare triple {39275#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {38844#false} is VALID [2022-04-28 06:48:30,330 INFO L290 TraceCheckUtils]: 130: Hoare triple {39279#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39275#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:48:30,331 INFO L290 TraceCheckUtils]: 129: Hoare triple {39279#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,331 INFO L290 TraceCheckUtils]: 128: Hoare triple {39279#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,331 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38843#true} {39279#(< ~counter~0 20)} #86#return; {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,331 INFO L290 TraceCheckUtils]: 126: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,331 INFO L290 TraceCheckUtils]: 125: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L290 TraceCheckUtils]: 124: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L272 TraceCheckUtils]: 123: Hoare triple {39279#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38843#true} {39279#(< ~counter~0 20)} #84#return; {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,332 INFO L290 TraceCheckUtils]: 121: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L290 TraceCheckUtils]: 120: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L290 TraceCheckUtils]: 119: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L272 TraceCheckUtils]: 118: Hoare triple {39279#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,332 INFO L290 TraceCheckUtils]: 117: Hoare triple {39279#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,334 INFO L290 TraceCheckUtils]: 116: Hoare triple {39322#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39279#(< ~counter~0 20)} is VALID [2022-04-28 06:48:30,334 INFO L290 TraceCheckUtils]: 115: Hoare triple {39322#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,334 INFO L290 TraceCheckUtils]: 114: Hoare triple {39322#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,335 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38843#true} {39322#(< ~counter~0 19)} #86#return; {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 112: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 111: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 110: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L272 TraceCheckUtils]: 109: Hoare triple {39322#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38843#true} {39322#(< ~counter~0 19)} #84#return; {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 107: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 106: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,335 INFO L290 TraceCheckUtils]: 105: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,336 INFO L272 TraceCheckUtils]: 104: Hoare triple {39322#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,336 INFO L290 TraceCheckUtils]: 103: Hoare triple {39322#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {39365#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39322#(< ~counter~0 19)} is VALID [2022-04-28 06:48:30,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {39365#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {39365#(< ~counter~0 18)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,337 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38843#true} {39365#(< ~counter~0 18)} #86#return; {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,337 INFO L290 TraceCheckUtils]: 97: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L290 TraceCheckUtils]: 96: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L272 TraceCheckUtils]: 95: Hoare triple {39365#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38843#true} {39365#(< ~counter~0 18)} #84#return; {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L272 TraceCheckUtils]: 90: Hoare triple {39365#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {39365#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {39408#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39365#(< ~counter~0 18)} is VALID [2022-04-28 06:48:30,339 INFO L290 TraceCheckUtils]: 87: Hoare triple {39408#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,340 INFO L290 TraceCheckUtils]: 86: Hoare triple {39408#(< ~counter~0 17)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,340 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38843#true} {39408#(< ~counter~0 17)} #86#return; {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,340 INFO L290 TraceCheckUtils]: 84: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,340 INFO L290 TraceCheckUtils]: 83: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,340 INFO L290 TraceCheckUtils]: 82: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,340 INFO L272 TraceCheckUtils]: 81: Hoare triple {39408#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,341 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38843#true} {39408#(< ~counter~0 17)} #84#return; {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,341 INFO L290 TraceCheckUtils]: 79: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,341 INFO L272 TraceCheckUtils]: 76: Hoare triple {39408#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {39408#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,342 INFO L290 TraceCheckUtils]: 74: Hoare triple {39451#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39408#(< ~counter~0 17)} is VALID [2022-04-28 06:48:30,342 INFO L290 TraceCheckUtils]: 73: Hoare triple {39451#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,342 INFO L290 TraceCheckUtils]: 72: Hoare triple {39451#(< ~counter~0 16)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,343 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38843#true} {39451#(< ~counter~0 16)} #86#return; {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,343 INFO L290 TraceCheckUtils]: 70: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,343 INFO L290 TraceCheckUtils]: 69: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,343 INFO L272 TraceCheckUtils]: 67: Hoare triple {39451#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,343 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38843#true} {39451#(< ~counter~0 16)} #84#return; {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,344 INFO L272 TraceCheckUtils]: 62: Hoare triple {39451#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {39451#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {39494#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39451#(< ~counter~0 16)} is VALID [2022-04-28 06:48:30,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {39494#(< ~counter~0 15)} assume !(~r~0 >= ~d~0); {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,345 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38843#true} {39494#(< ~counter~0 15)} #82#return; {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L272 TraceCheckUtils]: 54: Hoare triple {39494#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38843#true} {39494#(< ~counter~0 15)} #80#return; {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,346 INFO L272 TraceCheckUtils]: 49: Hoare triple {39494#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,347 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38843#true} {39494#(< ~counter~0 15)} #78#return; {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,347 INFO L272 TraceCheckUtils]: 44: Hoare triple {39494#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {39494#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {39549#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39494#(< ~counter~0 15)} is VALID [2022-04-28 06:48:30,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {39549#(< ~counter~0 14)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,349 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38843#true} {39549#(< ~counter~0 14)} #82#return; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L272 TraceCheckUtils]: 36: Hoare triple {39549#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38843#true} {39549#(< ~counter~0 14)} #80#return; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,349 INFO L272 TraceCheckUtils]: 31: Hoare triple {39549#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,350 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38843#true} {39549#(< ~counter~0 14)} #78#return; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,350 INFO L272 TraceCheckUtils]: 26: Hoare triple {39549#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {39549#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {39604#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39549#(< ~counter~0 14)} is VALID [2022-04-28 06:48:30,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {39604#(< ~counter~0 13)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,351 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38843#true} {39604#(< ~counter~0 13)} #82#return; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {39604#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38843#true} {39604#(< ~counter~0 13)} #80#return; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {39604#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,353 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38843#true} {39604#(< ~counter~0 13)} #78#return; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {38843#true} assume true; {38843#true} is VALID [2022-04-28 06:48:30,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {38843#true} assume !(0 == ~cond); {38843#true} is VALID [2022-04-28 06:48:30,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {38843#true} ~cond := #in~cond; {38843#true} is VALID [2022-04-28 06:48:30,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {39604#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38843#true} is VALID [2022-04-28 06:48:30,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {39604#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {39659#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39604#(< ~counter~0 13)} is VALID [2022-04-28 06:48:30,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {39659#(< ~counter~0 12)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {39659#(< ~counter~0 12)} is VALID [2022-04-28 06:48:30,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {39659#(< ~counter~0 12)} call #t~ret7 := main(); {39659#(< ~counter~0 12)} is VALID [2022-04-28 06:48:30,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39659#(< ~counter~0 12)} {38843#true} #92#return; {39659#(< ~counter~0 12)} is VALID [2022-04-28 06:48:30,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {39659#(< ~counter~0 12)} assume true; {39659#(< ~counter~0 12)} is VALID [2022-04-28 06:48:30,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {38843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {39659#(< ~counter~0 12)} is VALID [2022-04-28 06:48:30,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {38843#true} call ULTIMATE.init(); {38843#true} is VALID [2022-04-28 06:48:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 88 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 06:48:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903025528] [2022-04-28 06:48:30,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728259091] [2022-04-28 06:48:30,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728259091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:30,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:30,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 06:48:30,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1094852751] [2022-04-28 06:48:30,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1094852751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:30,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:30,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 06:48:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312212360] [2022-04-28 06:48:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 06:48:30,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:30,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 06:48:30,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 06:48:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 06:48:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 06:48:30,442 INFO L87 Difference]: Start difference. First operand 391 states and 436 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 06:48:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:31,876 INFO L93 Difference]: Finished difference Result 487 states and 554 transitions. [2022-04-28 06:48:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 06:48:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 06:48:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 06:48:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 06:48:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 06:48:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 06:48:31,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 193 transitions. [2022-04-28 06:48:32,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:32,042 INFO L225 Difference]: With dead ends: 487 [2022-04-28 06:48:32,042 INFO L226 Difference]: Without dead ends: 474 [2022-04-28 06:48:32,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2022-04-28 06:48:32,043 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 85 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:32,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 239 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:48:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-28 06:48:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 473. [2022-04-28 06:48:32,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:32,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 06:48:32,725 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 06:48:32,725 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 06:48:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:32,733 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2022-04-28 06:48:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 533 transitions. [2022-04-28 06:48:32,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:32,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:32,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) Second operand 474 states. [2022-04-28 06:48:32,735 INFO L87 Difference]: Start difference. First operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) Second operand 474 states. [2022-04-28 06:48:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:32,742 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2022-04-28 06:48:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 533 transitions. [2022-04-28 06:48:32,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:32,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:32,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:32,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 06:48:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 532 transitions. [2022-04-28 06:48:32,754 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 532 transitions. Word has length 136 [2022-04-28 06:48:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:32,754 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 532 transitions. [2022-04-28 06:48:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 06:48:32,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 532 transitions. [2022-04-28 06:48:33,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 532 transitions. [2022-04-28 06:48:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-28 06:48:33,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:33,788 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:33,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:33,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 06:48:33,989 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 13 times [2022-04-28 06:48:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:33,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721379693] [2022-04-28 06:48:36,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:36,195 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:36,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 14 times [2022-04-28 06:48:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:36,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251510539] [2022-04-28 06:48:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:36,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:36,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917734566] [2022-04-28 06:48:36,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:48:36,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:36,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:36,211 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:36,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 06:48:36,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:48:36,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:36,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 06:48:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:36,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:36,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {42558#true} call ULTIMATE.init(); {42558#true} is VALID [2022-04-28 06:48:36,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {42558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42566#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:36,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {42566#(<= ~counter~0 0)} assume true; {42566#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:36,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42566#(<= ~counter~0 0)} {42558#true} #92#return; {42566#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:36,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {42566#(<= ~counter~0 0)} call #t~ret7 := main(); {42566#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:36,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {42566#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42566#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:36,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {42566#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {42582#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,959 INFO L272 TraceCheckUtils]: 8: Hoare triple {42582#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {42582#(<= ~counter~0 1)} ~cond := #in~cond; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {42582#(<= ~counter~0 1)} assume !(0 == ~cond); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {42582#(<= ~counter~0 1)} assume true; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,960 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42582#(<= ~counter~0 1)} {42582#(<= ~counter~0 1)} #78#return; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,960 INFO L272 TraceCheckUtils]: 13: Hoare triple {42582#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {42582#(<= ~counter~0 1)} ~cond := #in~cond; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {42582#(<= ~counter~0 1)} assume !(0 == ~cond); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {42582#(<= ~counter~0 1)} assume true; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,961 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42582#(<= ~counter~0 1)} {42582#(<= ~counter~0 1)} #80#return; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,962 INFO L272 TraceCheckUtils]: 18: Hoare triple {42582#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {42582#(<= ~counter~0 1)} ~cond := #in~cond; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {42582#(<= ~counter~0 1)} assume !(0 == ~cond); {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {42582#(<= ~counter~0 1)} assume true; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,963 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42582#(<= ~counter~0 1)} {42582#(<= ~counter~0 1)} #82#return; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {42582#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42582#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:36,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {42582#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {42637#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,964 INFO L272 TraceCheckUtils]: 26: Hoare triple {42637#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {42637#(<= ~counter~0 2)} ~cond := #in~cond; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {42637#(<= ~counter~0 2)} assume !(0 == ~cond); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {42637#(<= ~counter~0 2)} assume true; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,965 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42637#(<= ~counter~0 2)} {42637#(<= ~counter~0 2)} #78#return; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,966 INFO L272 TraceCheckUtils]: 31: Hoare triple {42637#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {42637#(<= ~counter~0 2)} ~cond := #in~cond; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {42637#(<= ~counter~0 2)} assume !(0 == ~cond); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {42637#(<= ~counter~0 2)} assume true; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,967 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42637#(<= ~counter~0 2)} {42637#(<= ~counter~0 2)} #80#return; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,967 INFO L272 TraceCheckUtils]: 36: Hoare triple {42637#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {42637#(<= ~counter~0 2)} ~cond := #in~cond; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {42637#(<= ~counter~0 2)} assume !(0 == ~cond); {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {42637#(<= ~counter~0 2)} assume true; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,968 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42637#(<= ~counter~0 2)} {42637#(<= ~counter~0 2)} #82#return; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {42637#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42637#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:36,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {42637#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {42692#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,970 INFO L272 TraceCheckUtils]: 44: Hoare triple {42692#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {42692#(<= ~counter~0 3)} ~cond := #in~cond; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {42692#(<= ~counter~0 3)} assume !(0 == ~cond); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {42692#(<= ~counter~0 3)} assume true; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,971 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42692#(<= ~counter~0 3)} {42692#(<= ~counter~0 3)} #78#return; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,971 INFO L272 TraceCheckUtils]: 49: Hoare triple {42692#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {42692#(<= ~counter~0 3)} ~cond := #in~cond; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {42692#(<= ~counter~0 3)} assume !(0 == ~cond); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {42692#(<= ~counter~0 3)} assume true; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,973 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42692#(<= ~counter~0 3)} {42692#(<= ~counter~0 3)} #80#return; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,973 INFO L272 TraceCheckUtils]: 54: Hoare triple {42692#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {42692#(<= ~counter~0 3)} ~cond := #in~cond; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {42692#(<= ~counter~0 3)} assume !(0 == ~cond); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {42692#(<= ~counter~0 3)} assume true; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,974 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42692#(<= ~counter~0 3)} {42692#(<= ~counter~0 3)} #82#return; {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {42692#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {42692#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:36,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {42692#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {42747#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,976 INFO L272 TraceCheckUtils]: 62: Hoare triple {42747#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {42747#(<= ~counter~0 4)} ~cond := #in~cond; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {42747#(<= ~counter~0 4)} assume !(0 == ~cond); {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {42747#(<= ~counter~0 4)} assume true; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,977 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42747#(<= ~counter~0 4)} {42747#(<= ~counter~0 4)} #84#return; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,977 INFO L272 TraceCheckUtils]: 67: Hoare triple {42747#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {42747#(<= ~counter~0 4)} ~cond := #in~cond; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {42747#(<= ~counter~0 4)} assume !(0 == ~cond); {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,978 INFO L290 TraceCheckUtils]: 70: Hoare triple {42747#(<= ~counter~0 4)} assume true; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,978 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42747#(<= ~counter~0 4)} {42747#(<= ~counter~0 4)} #86#return; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {42747#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {42747#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42747#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:36,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {42747#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {42790#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,981 INFO L272 TraceCheckUtils]: 76: Hoare triple {42790#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {42790#(<= ~counter~0 5)} ~cond := #in~cond; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {42790#(<= ~counter~0 5)} assume !(0 == ~cond); {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {42790#(<= ~counter~0 5)} assume true; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,982 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42790#(<= ~counter~0 5)} {42790#(<= ~counter~0 5)} #84#return; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,982 INFO L272 TraceCheckUtils]: 81: Hoare triple {42790#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {42790#(<= ~counter~0 5)} ~cond := #in~cond; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,983 INFO L290 TraceCheckUtils]: 83: Hoare triple {42790#(<= ~counter~0 5)} assume !(0 == ~cond); {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,983 INFO L290 TraceCheckUtils]: 84: Hoare triple {42790#(<= ~counter~0 5)} assume true; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,983 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42790#(<= ~counter~0 5)} {42790#(<= ~counter~0 5)} #86#return; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,983 INFO L290 TraceCheckUtils]: 86: Hoare triple {42790#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,984 INFO L290 TraceCheckUtils]: 87: Hoare triple {42790#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42790#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:36,984 INFO L290 TraceCheckUtils]: 88: Hoare triple {42790#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {42833#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,985 INFO L272 TraceCheckUtils]: 90: Hoare triple {42833#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,985 INFO L290 TraceCheckUtils]: 91: Hoare triple {42833#(<= ~counter~0 6)} ~cond := #in~cond; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {42833#(<= ~counter~0 6)} assume !(0 == ~cond); {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,986 INFO L290 TraceCheckUtils]: 93: Hoare triple {42833#(<= ~counter~0 6)} assume true; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,986 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42833#(<= ~counter~0 6)} {42833#(<= ~counter~0 6)} #84#return; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,987 INFO L272 TraceCheckUtils]: 95: Hoare triple {42833#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,987 INFO L290 TraceCheckUtils]: 96: Hoare triple {42833#(<= ~counter~0 6)} ~cond := #in~cond; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,987 INFO L290 TraceCheckUtils]: 97: Hoare triple {42833#(<= ~counter~0 6)} assume !(0 == ~cond); {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {42833#(<= ~counter~0 6)} assume true; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,988 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42833#(<= ~counter~0 6)} {42833#(<= ~counter~0 6)} #86#return; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,988 INFO L290 TraceCheckUtils]: 100: Hoare triple {42833#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,988 INFO L290 TraceCheckUtils]: 101: Hoare triple {42833#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42833#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:36,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {42833#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {42876#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,990 INFO L272 TraceCheckUtils]: 104: Hoare triple {42876#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {42876#(<= ~counter~0 7)} ~cond := #in~cond; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {42876#(<= ~counter~0 7)} assume !(0 == ~cond); {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {42876#(<= ~counter~0 7)} assume true; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,991 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42876#(<= ~counter~0 7)} {42876#(<= ~counter~0 7)} #84#return; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,991 INFO L272 TraceCheckUtils]: 109: Hoare triple {42876#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,992 INFO L290 TraceCheckUtils]: 110: Hoare triple {42876#(<= ~counter~0 7)} ~cond := #in~cond; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,992 INFO L290 TraceCheckUtils]: 111: Hoare triple {42876#(<= ~counter~0 7)} assume !(0 == ~cond); {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {42876#(<= ~counter~0 7)} assume true; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,992 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42876#(<= ~counter~0 7)} {42876#(<= ~counter~0 7)} #86#return; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {42876#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {42876#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42876#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:36,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {42876#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {42919#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,995 INFO L272 TraceCheckUtils]: 118: Hoare triple {42919#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,995 INFO L290 TraceCheckUtils]: 119: Hoare triple {42919#(<= ~counter~0 8)} ~cond := #in~cond; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {42919#(<= ~counter~0 8)} assume !(0 == ~cond); {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {42919#(<= ~counter~0 8)} assume true; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,996 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42919#(<= ~counter~0 8)} {42919#(<= ~counter~0 8)} #84#return; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,996 INFO L272 TraceCheckUtils]: 123: Hoare triple {42919#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,996 INFO L290 TraceCheckUtils]: 124: Hoare triple {42919#(<= ~counter~0 8)} ~cond := #in~cond; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,997 INFO L290 TraceCheckUtils]: 125: Hoare triple {42919#(<= ~counter~0 8)} assume !(0 == ~cond); {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,997 INFO L290 TraceCheckUtils]: 126: Hoare triple {42919#(<= ~counter~0 8)} assume true; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,997 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42919#(<= ~counter~0 8)} {42919#(<= ~counter~0 8)} #86#return; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,997 INFO L290 TraceCheckUtils]: 128: Hoare triple {42919#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,998 INFO L290 TraceCheckUtils]: 129: Hoare triple {42919#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42919#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:36,998 INFO L290 TraceCheckUtils]: 130: Hoare triple {42919#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:36,999 INFO L290 TraceCheckUtils]: 131: Hoare triple {42962#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:36,999 INFO L272 TraceCheckUtils]: 132: Hoare triple {42962#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:36,999 INFO L290 TraceCheckUtils]: 133: Hoare triple {42962#(<= ~counter~0 9)} ~cond := #in~cond; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,000 INFO L290 TraceCheckUtils]: 134: Hoare triple {42962#(<= ~counter~0 9)} assume !(0 == ~cond); {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,000 INFO L290 TraceCheckUtils]: 135: Hoare triple {42962#(<= ~counter~0 9)} assume true; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,000 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42962#(<= ~counter~0 9)} {42962#(<= ~counter~0 9)} #84#return; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,001 INFO L272 TraceCheckUtils]: 137: Hoare triple {42962#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,001 INFO L290 TraceCheckUtils]: 138: Hoare triple {42962#(<= ~counter~0 9)} ~cond := #in~cond; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,001 INFO L290 TraceCheckUtils]: 139: Hoare triple {42962#(<= ~counter~0 9)} assume !(0 == ~cond); {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,001 INFO L290 TraceCheckUtils]: 140: Hoare triple {42962#(<= ~counter~0 9)} assume true; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,002 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42962#(<= ~counter~0 9)} {42962#(<= ~counter~0 9)} #86#return; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,002 INFO L290 TraceCheckUtils]: 142: Hoare triple {42962#(<= ~counter~0 9)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,002 INFO L290 TraceCheckUtils]: 143: Hoare triple {42962#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42962#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:37,002 INFO L290 TraceCheckUtils]: 144: Hoare triple {42962#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43005#(<= |main_#t~post6| 9)} is VALID [2022-04-28 06:48:37,003 INFO L290 TraceCheckUtils]: 145: Hoare triple {43005#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {42559#false} is VALID [2022-04-28 06:48:37,003 INFO L272 TraceCheckUtils]: 146: Hoare triple {42559#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42559#false} is VALID [2022-04-28 06:48:37,003 INFO L290 TraceCheckUtils]: 147: Hoare triple {42559#false} ~cond := #in~cond; {42559#false} is VALID [2022-04-28 06:48:37,003 INFO L290 TraceCheckUtils]: 148: Hoare triple {42559#false} assume 0 == ~cond; {42559#false} is VALID [2022-04-28 06:48:37,003 INFO L290 TraceCheckUtils]: 149: Hoare triple {42559#false} assume !false; {42559#false} is VALID [2022-04-28 06:48:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 900 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 06:48:37,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:48:37,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {42559#false} assume !false; {42559#false} is VALID [2022-04-28 06:48:37,680 INFO L290 TraceCheckUtils]: 148: Hoare triple {42559#false} assume 0 == ~cond; {42559#false} is VALID [2022-04-28 06:48:37,680 INFO L290 TraceCheckUtils]: 147: Hoare triple {42559#false} ~cond := #in~cond; {42559#false} is VALID [2022-04-28 06:48:37,680 INFO L272 TraceCheckUtils]: 146: Hoare triple {42559#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42559#false} is VALID [2022-04-28 06:48:37,681 INFO L290 TraceCheckUtils]: 145: Hoare triple {43033#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {42559#false} is VALID [2022-04-28 06:48:37,681 INFO L290 TraceCheckUtils]: 144: Hoare triple {43037#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43033#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:48:37,681 INFO L290 TraceCheckUtils]: 143: Hoare triple {43037#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,681 INFO L290 TraceCheckUtils]: 142: Hoare triple {43037#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,682 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42558#true} {43037#(< ~counter~0 20)} #86#return; {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,682 INFO L290 TraceCheckUtils]: 140: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,682 INFO L290 TraceCheckUtils]: 139: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,682 INFO L290 TraceCheckUtils]: 138: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,682 INFO L272 TraceCheckUtils]: 137: Hoare triple {43037#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,682 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42558#true} {43037#(< ~counter~0 20)} #84#return; {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,683 INFO L290 TraceCheckUtils]: 135: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,683 INFO L290 TraceCheckUtils]: 134: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,683 INFO L272 TraceCheckUtils]: 132: Hoare triple {43037#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,683 INFO L290 TraceCheckUtils]: 131: Hoare triple {43037#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,684 INFO L290 TraceCheckUtils]: 130: Hoare triple {43080#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43037#(< ~counter~0 20)} is VALID [2022-04-28 06:48:37,684 INFO L290 TraceCheckUtils]: 129: Hoare triple {43080#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,685 INFO L290 TraceCheckUtils]: 128: Hoare triple {43080#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,685 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42558#true} {43080#(< ~counter~0 19)} #86#return; {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,685 INFO L290 TraceCheckUtils]: 126: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,685 INFO L290 TraceCheckUtils]: 125: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,685 INFO L290 TraceCheckUtils]: 124: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,685 INFO L272 TraceCheckUtils]: 123: Hoare triple {43080#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,686 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42558#true} {43080#(< ~counter~0 19)} #84#return; {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,686 INFO L290 TraceCheckUtils]: 121: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,686 INFO L290 TraceCheckUtils]: 120: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,686 INFO L290 TraceCheckUtils]: 119: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,686 INFO L272 TraceCheckUtils]: 118: Hoare triple {43080#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,686 INFO L290 TraceCheckUtils]: 117: Hoare triple {43080#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,687 INFO L290 TraceCheckUtils]: 116: Hoare triple {43123#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43080#(< ~counter~0 19)} is VALID [2022-04-28 06:48:37,687 INFO L290 TraceCheckUtils]: 115: Hoare triple {43123#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,687 INFO L290 TraceCheckUtils]: 114: Hoare triple {43123#(< ~counter~0 18)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,687 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42558#true} {43123#(< ~counter~0 18)} #86#return; {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 112: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L272 TraceCheckUtils]: 109: Hoare triple {43123#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42558#true} {43123#(< ~counter~0 18)} #84#return; {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 107: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 106: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L290 TraceCheckUtils]: 105: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,688 INFO L272 TraceCheckUtils]: 104: Hoare triple {43123#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,689 INFO L290 TraceCheckUtils]: 103: Hoare triple {43123#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,689 INFO L290 TraceCheckUtils]: 102: Hoare triple {43166#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43123#(< ~counter~0 18)} is VALID [2022-04-28 06:48:37,689 INFO L290 TraceCheckUtils]: 101: Hoare triple {43166#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,690 INFO L290 TraceCheckUtils]: 100: Hoare triple {43166#(< ~counter~0 17)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,690 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42558#true} {43166#(< ~counter~0 17)} #86#return; {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,690 INFO L290 TraceCheckUtils]: 96: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,690 INFO L272 TraceCheckUtils]: 95: Hoare triple {43166#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,691 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42558#true} {43166#(< ~counter~0 17)} #84#return; {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,691 INFO L290 TraceCheckUtils]: 91: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,691 INFO L272 TraceCheckUtils]: 90: Hoare triple {43166#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {43166#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {43209#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43166#(< ~counter~0 17)} is VALID [2022-04-28 06:48:37,692 INFO L290 TraceCheckUtils]: 87: Hoare triple {43209#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {43209#(< ~counter~0 16)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,692 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42558#true} {43209#(< ~counter~0 16)} #86#return; {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 84: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 83: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 82: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L272 TraceCheckUtils]: 81: Hoare triple {43209#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42558#true} {43209#(< ~counter~0 16)} #84#return; {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 79: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 78: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,693 INFO L272 TraceCheckUtils]: 76: Hoare triple {43209#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {43209#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {43252#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43209#(< ~counter~0 16)} is VALID [2022-04-28 06:48:37,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {43252#(< ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {43252#(< ~counter~0 15)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,695 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42558#true} {43252#(< ~counter~0 15)} #86#return; {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,695 INFO L272 TraceCheckUtils]: 67: Hoare triple {43252#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,696 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42558#true} {43252#(< ~counter~0 15)} #84#return; {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,696 INFO L272 TraceCheckUtils]: 62: Hoare triple {43252#(< ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {43252#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {43295#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43252#(< ~counter~0 15)} is VALID [2022-04-28 06:48:37,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {43295#(< ~counter~0 14)} assume !(~r~0 >= ~d~0); {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,698 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42558#true} {43295#(< ~counter~0 14)} #82#return; {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L272 TraceCheckUtils]: 54: Hoare triple {43295#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42558#true} {43295#(< ~counter~0 14)} #80#return; {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,698 INFO L272 TraceCheckUtils]: 49: Hoare triple {43295#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,699 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42558#true} {43295#(< ~counter~0 14)} #78#return; {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,699 INFO L272 TraceCheckUtils]: 44: Hoare triple {43295#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {43295#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {43350#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43295#(< ~counter~0 14)} is VALID [2022-04-28 06:48:37,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {43350#(< ~counter~0 13)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,700 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42558#true} {43350#(< ~counter~0 13)} #82#return; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L272 TraceCheckUtils]: 36: Hoare triple {43350#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42558#true} {43350#(< ~counter~0 13)} #80#return; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L272 TraceCheckUtils]: 31: Hoare triple {43350#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,701 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42558#true} {43350#(< ~counter~0 13)} #78#return; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,702 INFO L272 TraceCheckUtils]: 26: Hoare triple {43350#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {43350#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {43405#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43350#(< ~counter~0 13)} is VALID [2022-04-28 06:48:37,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {43405#(< ~counter~0 12)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,703 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42558#true} {43405#(< ~counter~0 12)} #82#return; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,703 INFO L272 TraceCheckUtils]: 18: Hoare triple {43405#(< ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42558#true} {43405#(< ~counter~0 12)} #80#return; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {43405#(< ~counter~0 12)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42558#true} {43405#(< ~counter~0 12)} #78#return; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {42558#true} assume true; {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {42558#true} assume !(0 == ~cond); {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {42558#true} ~cond := #in~cond; {42558#true} is VALID [2022-04-28 06:48:37,704 INFO L272 TraceCheckUtils]: 8: Hoare triple {43405#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42558#true} is VALID [2022-04-28 06:48:37,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {43405#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {43460#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43405#(< ~counter~0 12)} is VALID [2022-04-28 06:48:37,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {43460#(< ~counter~0 11)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {43460#(< ~counter~0 11)} is VALID [2022-04-28 06:48:37,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {43460#(< ~counter~0 11)} call #t~ret7 := main(); {43460#(< ~counter~0 11)} is VALID [2022-04-28 06:48:37,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43460#(< ~counter~0 11)} {42558#true} #92#return; {43460#(< ~counter~0 11)} is VALID [2022-04-28 06:48:37,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {43460#(< ~counter~0 11)} assume true; {43460#(< ~counter~0 11)} is VALID [2022-04-28 06:48:37,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {42558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43460#(< ~counter~0 11)} is VALID [2022-04-28 06:48:37,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {42558#true} call ULTIMATE.init(); {42558#true} is VALID [2022-04-28 06:48:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 06:48:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:48:37,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251510539] [2022-04-28 06:48:37,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:48:37,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917734566] [2022-04-28 06:48:37,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917734566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:48:37,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:48:37,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 06:48:37,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:48:37,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721379693] [2022-04-28 06:48:37,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721379693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:48:37,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:48:37,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:48:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604424295] [2022-04-28 06:48:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:48:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 06:48:37,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:48:37,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 06:48:37,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:37,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:48:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:48:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:48:37,809 INFO L87 Difference]: Start difference. First operand 473 states and 532 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 06:48:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:39,397 INFO L93 Difference]: Finished difference Result 579 states and 663 transitions. [2022-04-28 06:48:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 06:48:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 06:48:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:48:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 06:48:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 06:48:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 06:48:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 06:48:39,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 216 transitions. [2022-04-28 06:48:39,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:39,591 INFO L225 Difference]: With dead ends: 579 [2022-04-28 06:48:39,591 INFO L226 Difference]: Without dead ends: 566 [2022-04-28 06:48:39,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=356, Invalid=514, Unknown=0, NotChecked=0, Total=870 [2022-04-28 06:48:39,592 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 91 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:48:39,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 269 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:48:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-04-28 06:48:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2022-04-28 06:48:40,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:48:40,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 06:48:40,413 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 06:48:40,414 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 06:48:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:40,424 INFO L93 Difference]: Finished difference Result 566 states and 641 transitions. [2022-04-28 06:48:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 641 transitions. [2022-04-28 06:48:40,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:40,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:40,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) Second operand 566 states. [2022-04-28 06:48:40,426 INFO L87 Difference]: Start difference. First operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) Second operand 566 states. [2022-04-28 06:48:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:48:40,436 INFO L93 Difference]: Finished difference Result 566 states and 641 transitions. [2022-04-28 06:48:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 641 transitions. [2022-04-28 06:48:40,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:48:40,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:48:40,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:48:40,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:48:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 06:48:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 640 transitions. [2022-04-28 06:48:40,452 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 640 transitions. Word has length 150 [2022-04-28 06:48:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:48:40,452 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 640 transitions. [2022-04-28 06:48:40,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 06:48:40,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 565 states and 640 transitions. [2022-04-28 06:48:41,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:48:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 640 transitions. [2022-04-28 06:48:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 06:48:41,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:48:41,753 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 8, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:48:41,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 06:48:41,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:41,953 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:48:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:48:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 15 times [2022-04-28 06:48:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:48:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306504143] [2022-04-28 06:48:44,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:48:44,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:48:44,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:48:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 16 times [2022-04-28 06:48:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:48:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722007404] [2022-04-28 06:48:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:48:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:48:44,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:48:44,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356264233] [2022-04-28 06:48:44,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:48:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:48:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:48:44,467 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:48:44,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 06:48:51,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:48:51,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:48:51,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 06:48:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:48:51,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:48:52,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {46913#true} call ULTIMATE.init(); {46913#true} is VALID [2022-04-28 06:48:52,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {46913#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {46921#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:52,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {46921#(<= ~counter~0 0)} assume true; {46921#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:52,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46921#(<= ~counter~0 0)} {46913#true} #92#return; {46921#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:52,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {46921#(<= ~counter~0 0)} call #t~ret7 := main(); {46921#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:52,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {46921#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {46921#(<= ~counter~0 0)} is VALID [2022-04-28 06:48:52,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {46921#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {46937#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,064 INFO L272 TraceCheckUtils]: 8: Hoare triple {46937#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {46937#(<= ~counter~0 1)} ~cond := #in~cond; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {46937#(<= ~counter~0 1)} assume !(0 == ~cond); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {46937#(<= ~counter~0 1)} assume true; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,065 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46937#(<= ~counter~0 1)} {46937#(<= ~counter~0 1)} #78#return; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {46937#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {46937#(<= ~counter~0 1)} ~cond := #in~cond; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {46937#(<= ~counter~0 1)} assume !(0 == ~cond); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {46937#(<= ~counter~0 1)} assume true; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,066 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46937#(<= ~counter~0 1)} {46937#(<= ~counter~0 1)} #80#return; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,067 INFO L272 TraceCheckUtils]: 18: Hoare triple {46937#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {46937#(<= ~counter~0 1)} ~cond := #in~cond; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {46937#(<= ~counter~0 1)} assume !(0 == ~cond); {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {46937#(<= ~counter~0 1)} assume true; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,068 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46937#(<= ~counter~0 1)} {46937#(<= ~counter~0 1)} #82#return; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {46937#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46937#(<= ~counter~0 1)} is VALID [2022-04-28 06:48:52,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {46937#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {46992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,069 INFO L272 TraceCheckUtils]: 26: Hoare triple {46992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {46992#(<= ~counter~0 2)} ~cond := #in~cond; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {46992#(<= ~counter~0 2)} assume !(0 == ~cond); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {46992#(<= ~counter~0 2)} assume true; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,070 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46992#(<= ~counter~0 2)} {46992#(<= ~counter~0 2)} #78#return; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,071 INFO L272 TraceCheckUtils]: 31: Hoare triple {46992#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {46992#(<= ~counter~0 2)} ~cond := #in~cond; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {46992#(<= ~counter~0 2)} assume !(0 == ~cond); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {46992#(<= ~counter~0 2)} assume true; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,072 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46992#(<= ~counter~0 2)} {46992#(<= ~counter~0 2)} #80#return; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,072 INFO L272 TraceCheckUtils]: 36: Hoare triple {46992#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {46992#(<= ~counter~0 2)} ~cond := #in~cond; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {46992#(<= ~counter~0 2)} assume !(0 == ~cond); {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {46992#(<= ~counter~0 2)} assume true; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,073 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46992#(<= ~counter~0 2)} {46992#(<= ~counter~0 2)} #82#return; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {46992#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46992#(<= ~counter~0 2)} is VALID [2022-04-28 06:48:52,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {46992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {47047#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,075 INFO L272 TraceCheckUtils]: 44: Hoare triple {47047#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {47047#(<= ~counter~0 3)} ~cond := #in~cond; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {47047#(<= ~counter~0 3)} assume !(0 == ~cond); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {47047#(<= ~counter~0 3)} assume true; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,076 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47047#(<= ~counter~0 3)} {47047#(<= ~counter~0 3)} #78#return; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,076 INFO L272 TraceCheckUtils]: 49: Hoare triple {47047#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {47047#(<= ~counter~0 3)} ~cond := #in~cond; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {47047#(<= ~counter~0 3)} assume !(0 == ~cond); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {47047#(<= ~counter~0 3)} assume true; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,077 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47047#(<= ~counter~0 3)} {47047#(<= ~counter~0 3)} #80#return; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,078 INFO L272 TraceCheckUtils]: 54: Hoare triple {47047#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {47047#(<= ~counter~0 3)} ~cond := #in~cond; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {47047#(<= ~counter~0 3)} assume !(0 == ~cond); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {47047#(<= ~counter~0 3)} assume true; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,079 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47047#(<= ~counter~0 3)} {47047#(<= ~counter~0 3)} #82#return; {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {47047#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {47047#(<= ~counter~0 3)} is VALID [2022-04-28 06:48:52,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {47047#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {47102#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,081 INFO L272 TraceCheckUtils]: 62: Hoare triple {47102#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,081 INFO L290 TraceCheckUtils]: 63: Hoare triple {47102#(<= ~counter~0 4)} ~cond := #in~cond; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {47102#(<= ~counter~0 4)} assume !(0 == ~cond); {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,081 INFO L290 TraceCheckUtils]: 65: Hoare triple {47102#(<= ~counter~0 4)} assume true; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,082 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47102#(<= ~counter~0 4)} {47102#(<= ~counter~0 4)} #84#return; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,082 INFO L272 TraceCheckUtils]: 67: Hoare triple {47102#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {47102#(<= ~counter~0 4)} ~cond := #in~cond; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {47102#(<= ~counter~0 4)} assume !(0 == ~cond); {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {47102#(<= ~counter~0 4)} assume true; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,084 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47102#(<= ~counter~0 4)} {47102#(<= ~counter~0 4)} #86#return; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {47102#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {47102#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47102#(<= ~counter~0 4)} is VALID [2022-04-28 06:48:52,085 INFO L290 TraceCheckUtils]: 74: Hoare triple {47102#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,085 INFO L290 TraceCheckUtils]: 75: Hoare triple {47145#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,086 INFO L272 TraceCheckUtils]: 76: Hoare triple {47145#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {47145#(<= ~counter~0 5)} ~cond := #in~cond; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,086 INFO L290 TraceCheckUtils]: 78: Hoare triple {47145#(<= ~counter~0 5)} assume !(0 == ~cond); {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,086 INFO L290 TraceCheckUtils]: 79: Hoare triple {47145#(<= ~counter~0 5)} assume true; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,087 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47145#(<= ~counter~0 5)} {47145#(<= ~counter~0 5)} #84#return; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,087 INFO L272 TraceCheckUtils]: 81: Hoare triple {47145#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,087 INFO L290 TraceCheckUtils]: 82: Hoare triple {47145#(<= ~counter~0 5)} ~cond := #in~cond; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {47145#(<= ~counter~0 5)} assume !(0 == ~cond); {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {47145#(<= ~counter~0 5)} assume true; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,088 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47145#(<= ~counter~0 5)} {47145#(<= ~counter~0 5)} #86#return; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,088 INFO L290 TraceCheckUtils]: 86: Hoare triple {47145#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {47145#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47145#(<= ~counter~0 5)} is VALID [2022-04-28 06:48:52,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {47145#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,090 INFO L290 TraceCheckUtils]: 89: Hoare triple {47188#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,090 INFO L272 TraceCheckUtils]: 90: Hoare triple {47188#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,091 INFO L290 TraceCheckUtils]: 91: Hoare triple {47188#(<= ~counter~0 6)} ~cond := #in~cond; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,091 INFO L290 TraceCheckUtils]: 92: Hoare triple {47188#(<= ~counter~0 6)} assume !(0 == ~cond); {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,091 INFO L290 TraceCheckUtils]: 93: Hoare triple {47188#(<= ~counter~0 6)} assume true; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,092 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47188#(<= ~counter~0 6)} {47188#(<= ~counter~0 6)} #84#return; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,092 INFO L272 TraceCheckUtils]: 95: Hoare triple {47188#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,092 INFO L290 TraceCheckUtils]: 96: Hoare triple {47188#(<= ~counter~0 6)} ~cond := #in~cond; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,092 INFO L290 TraceCheckUtils]: 97: Hoare triple {47188#(<= ~counter~0 6)} assume !(0 == ~cond); {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,093 INFO L290 TraceCheckUtils]: 98: Hoare triple {47188#(<= ~counter~0 6)} assume true; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,093 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47188#(<= ~counter~0 6)} {47188#(<= ~counter~0 6)} #86#return; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {47188#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {47188#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47188#(<= ~counter~0 6)} is VALID [2022-04-28 06:48:52,094 INFO L290 TraceCheckUtils]: 102: Hoare triple {47188#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,095 INFO L290 TraceCheckUtils]: 103: Hoare triple {47231#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,095 INFO L272 TraceCheckUtils]: 104: Hoare triple {47231#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,095 INFO L290 TraceCheckUtils]: 105: Hoare triple {47231#(<= ~counter~0 7)} ~cond := #in~cond; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,096 INFO L290 TraceCheckUtils]: 106: Hoare triple {47231#(<= ~counter~0 7)} assume !(0 == ~cond); {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,096 INFO L290 TraceCheckUtils]: 107: Hoare triple {47231#(<= ~counter~0 7)} assume true; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,096 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47231#(<= ~counter~0 7)} {47231#(<= ~counter~0 7)} #84#return; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,097 INFO L272 TraceCheckUtils]: 109: Hoare triple {47231#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,097 INFO L290 TraceCheckUtils]: 110: Hoare triple {47231#(<= ~counter~0 7)} ~cond := #in~cond; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,097 INFO L290 TraceCheckUtils]: 111: Hoare triple {47231#(<= ~counter~0 7)} assume !(0 == ~cond); {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,097 INFO L290 TraceCheckUtils]: 112: Hoare triple {47231#(<= ~counter~0 7)} assume true; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,098 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47231#(<= ~counter~0 7)} {47231#(<= ~counter~0 7)} #86#return; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,098 INFO L290 TraceCheckUtils]: 114: Hoare triple {47231#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,098 INFO L290 TraceCheckUtils]: 115: Hoare triple {47231#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47231#(<= ~counter~0 7)} is VALID [2022-04-28 06:48:52,099 INFO L290 TraceCheckUtils]: 116: Hoare triple {47231#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,099 INFO L290 TraceCheckUtils]: 117: Hoare triple {47274#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,099 INFO L272 TraceCheckUtils]: 118: Hoare triple {47274#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,100 INFO L290 TraceCheckUtils]: 119: Hoare triple {47274#(<= ~counter~0 8)} ~cond := #in~cond; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,100 INFO L290 TraceCheckUtils]: 120: Hoare triple {47274#(<= ~counter~0 8)} assume !(0 == ~cond); {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,100 INFO L290 TraceCheckUtils]: 121: Hoare triple {47274#(<= ~counter~0 8)} assume true; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,111 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47274#(<= ~counter~0 8)} {47274#(<= ~counter~0 8)} #84#return; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,112 INFO L272 TraceCheckUtils]: 123: Hoare triple {47274#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,112 INFO L290 TraceCheckUtils]: 124: Hoare triple {47274#(<= ~counter~0 8)} ~cond := #in~cond; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,112 INFO L290 TraceCheckUtils]: 125: Hoare triple {47274#(<= ~counter~0 8)} assume !(0 == ~cond); {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,113 INFO L290 TraceCheckUtils]: 126: Hoare triple {47274#(<= ~counter~0 8)} assume true; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,113 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47274#(<= ~counter~0 8)} {47274#(<= ~counter~0 8)} #86#return; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,113 INFO L290 TraceCheckUtils]: 128: Hoare triple {47274#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,114 INFO L290 TraceCheckUtils]: 129: Hoare triple {47274#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47274#(<= ~counter~0 8)} is VALID [2022-04-28 06:48:52,115 INFO L290 TraceCheckUtils]: 130: Hoare triple {47274#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,115 INFO L290 TraceCheckUtils]: 131: Hoare triple {47317#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,116 INFO L272 TraceCheckUtils]: 132: Hoare triple {47317#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,116 INFO L290 TraceCheckUtils]: 133: Hoare triple {47317#(<= ~counter~0 9)} ~cond := #in~cond; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,116 INFO L290 TraceCheckUtils]: 134: Hoare triple {47317#(<= ~counter~0 9)} assume !(0 == ~cond); {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,116 INFO L290 TraceCheckUtils]: 135: Hoare triple {47317#(<= ~counter~0 9)} assume true; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,117 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47317#(<= ~counter~0 9)} {47317#(<= ~counter~0 9)} #84#return; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,117 INFO L272 TraceCheckUtils]: 137: Hoare triple {47317#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,118 INFO L290 TraceCheckUtils]: 138: Hoare triple {47317#(<= ~counter~0 9)} ~cond := #in~cond; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,118 INFO L290 TraceCheckUtils]: 139: Hoare triple {47317#(<= ~counter~0 9)} assume !(0 == ~cond); {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,118 INFO L290 TraceCheckUtils]: 140: Hoare triple {47317#(<= ~counter~0 9)} assume true; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,119 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47317#(<= ~counter~0 9)} {47317#(<= ~counter~0 9)} #86#return; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,119 INFO L290 TraceCheckUtils]: 142: Hoare triple {47317#(<= ~counter~0 9)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,119 INFO L290 TraceCheckUtils]: 143: Hoare triple {47317#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47317#(<= ~counter~0 9)} is VALID [2022-04-28 06:48:52,120 INFO L290 TraceCheckUtils]: 144: Hoare triple {47317#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,120 INFO L290 TraceCheckUtils]: 145: Hoare triple {47360#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,121 INFO L272 TraceCheckUtils]: 146: Hoare triple {47360#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,121 INFO L290 TraceCheckUtils]: 147: Hoare triple {47360#(<= ~counter~0 10)} ~cond := #in~cond; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,121 INFO L290 TraceCheckUtils]: 148: Hoare triple {47360#(<= ~counter~0 10)} assume !(0 == ~cond); {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,122 INFO L290 TraceCheckUtils]: 149: Hoare triple {47360#(<= ~counter~0 10)} assume true; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,122 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47360#(<= ~counter~0 10)} {47360#(<= ~counter~0 10)} #84#return; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,123 INFO L272 TraceCheckUtils]: 151: Hoare triple {47360#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,123 INFO L290 TraceCheckUtils]: 152: Hoare triple {47360#(<= ~counter~0 10)} ~cond := #in~cond; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,123 INFO L290 TraceCheckUtils]: 153: Hoare triple {47360#(<= ~counter~0 10)} assume !(0 == ~cond); {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,123 INFO L290 TraceCheckUtils]: 154: Hoare triple {47360#(<= ~counter~0 10)} assume true; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,124 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47360#(<= ~counter~0 10)} {47360#(<= ~counter~0 10)} #86#return; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,124 INFO L290 TraceCheckUtils]: 156: Hoare triple {47360#(<= ~counter~0 10)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,124 INFO L290 TraceCheckUtils]: 157: Hoare triple {47360#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47360#(<= ~counter~0 10)} is VALID [2022-04-28 06:48:52,124 INFO L290 TraceCheckUtils]: 158: Hoare triple {47360#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47403#(<= |main_#t~post6| 10)} is VALID [2022-04-28 06:48:52,125 INFO L290 TraceCheckUtils]: 159: Hoare triple {47403#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {46914#false} is VALID [2022-04-28 06:48:52,125 INFO L272 TraceCheckUtils]: 160: Hoare triple {46914#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46914#false} is VALID [2022-04-28 06:48:52,125 INFO L290 TraceCheckUtils]: 161: Hoare triple {46914#false} ~cond := #in~cond; {46914#false} is VALID [2022-04-28 06:48:52,125 INFO L290 TraceCheckUtils]: 162: Hoare triple {46914#false} assume 0 == ~cond; {46914#false} is VALID [2022-04-28 06:48:52,125 INFO L290 TraceCheckUtils]: 163: Hoare triple {46914#false} assume !false; {46914#false} is VALID [2022-04-28 06:48:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 46 proven. 1106 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 06:48:52,126 INFO L328 TraceCheckSpWp]: Computing backward predicates...