/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 13:12:46,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 13:12:46,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 13:12:46,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 13:12:46,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 13:12:46,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 13:12:46,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 13:12:46,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 13:12:46,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 13:12:46,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 13:12:46,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 13:12:46,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 13:12:46,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 13:12:46,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 13:12:46,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 13:12:46,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 13:12:46,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 13:12:46,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 13:12:46,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 13:12:46,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 13:12:46,763 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 13:12:46,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 13:12:46,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 13:12:46,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 13:12:46,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 13:12:46,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 13:12:46,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 13:12:46,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 13:12:46,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 13:12:46,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 13:12:46,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 13:12:46,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 13:12:46,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 13:12:46,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 13:12:46,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 13:12:46,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 13:12:46,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 13:12:46,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 13:12:46,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 13:12:46,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 13:12:46,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 13:12:46,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 13:12:46,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 13:12:46,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 13:12:46,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 13:12:46,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 13:12:46,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 13:12:46,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 13:12:46,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 13:12:46,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 13:12:46,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 13:12:46,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 13:12:46,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 13:12:46,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 13:12:46,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 13:12:46,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 13:12:46,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:46,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 13:12:46,787 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 13:12:46,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 13:12:46,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 13:12:46,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 13:12:46,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 13:12:46,961 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 13:12:46,962 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-08 13:12:47,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed08f60/bec9004f9f2640b2bf5cdbec311f25a7/FLAG3b107720c [2022-04-08 13:12:47,333 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 13:12:47,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound20.c [2022-04-08 13:12:47,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed08f60/bec9004f9f2640b2bf5cdbec311f25a7/FLAG3b107720c [2022-04-08 13:12:47,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed08f60/bec9004f9f2640b2bf5cdbec311f25a7 [2022-04-08 13:12:47,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 13:12:47,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 13:12:47,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:47,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 13:12:47,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 13:12:47,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:47" (1/1) ... [2022-04-08 13:12:47,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b7984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:47, skipping insertion in model container [2022-04-08 13:12:47,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:47" (1/1) ... [2022-04-08 13:12:47,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 13:12:47,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 13:12:47,934 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-08 13:12:47,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:47,993 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 13:12:48,011 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-08 13:12:48,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:48,038 INFO L208 MainTranslator]: Completed translation [2022-04-08 13:12:48,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48 WrapperNode [2022-04-08 13:12:48,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:48,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 13:12:48,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 13:12:48,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 13:12:48,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 13:12:48,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 13:12:48,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 13:12:48,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 13:12:48,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (1/1) ... [2022-04-08 13:12:48,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:48,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 13:12:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 13:12:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 13:12:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 13:12:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 13:12:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 13:12:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 13:12:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 13:12:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 13:12:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 13:12:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 13:12:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 13:12:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 13:12:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 13:12:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 13:12:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 13:12:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 13:12:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 13:12:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 13:12:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 13:12:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 13:12:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 13:12:48,209 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 13:12:48,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 13:12:48,335 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 13:12:48,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 13:12:48,341 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 13:12:48,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:48 BoogieIcfgContainer [2022-04-08 13:12:48,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 13:12:48,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 13:12:48,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 13:12:48,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 13:12:48,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:12:47" (1/3) ... [2022-04-08 13:12:48,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d885461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:48, skipping insertion in model container [2022-04-08 13:12:48,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:48" (2/3) ... [2022-04-08 13:12:48,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d885461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:48, skipping insertion in model container [2022-04-08 13:12:48,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:48" (3/3) ... [2022-04-08 13:12:48,348 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound20.c [2022-04-08 13:12:48,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 13:12:48,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 13:12:48,385 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 13:12:48,391 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 13:12:48,391 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 13:12:48,405 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-08 13:12:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:48,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:48,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:48,412 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-08 13:12:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:48,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157047377] [2022-04-08 13:12:48,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-08 13:12:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:48,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884852357] [2022-04-08 13:12:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:48,552 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-08 13:12:48,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:48,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:48,554 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-08 13:12:48,554 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-08 13:12:48,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:48,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:48,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-08 13:12:48,555 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-08 13:12:48,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 13:12:48,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 13:12:48,555 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-08 13:12:48,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 13:12:48,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 13:12:48,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 13:12:48,556 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-08 13:12:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884852357] [2022-04-08 13:12:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884852357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:48,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:48,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:48,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:48,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157047377] [2022-04-08 13:12:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157047377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:48,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:48,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054145553] [2022-04-08 13:12:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:48,563 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-08 13:12:48,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:48,566 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-08 13:12:48,578 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-08 13:12:48,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 13:12:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 13:12:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:12:48,603 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-08 13:12:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:48,785 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-08 13:12:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 13:12:48,786 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-08 13:12:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:48,787 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-08 13:12:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:48,806 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-08 13:12:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:48,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 13:12:48,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:48,926 INFO L225 Difference]: With dead ends: 57 [2022-04-08 13:12:48,926 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 13:12:48,931 INFO L912 BasicCegarLoop]: 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-08 13:12:48,938 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:48,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 13:12:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 13:12:48,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:48,968 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-08 13:12:48,969 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-08 13:12:48,969 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-08 13:12:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:48,973 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:48,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:48,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:48,974 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-08 13:12:48,974 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-08 13:12:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:48,977 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:48,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:48,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:48,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:48,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:48,999 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-08 13:12:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-08 13:12:49,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-08 13:12:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:49,003 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-08 13:12:49,003 INFO L479 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-08 13:12:49,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-08 13:12:49,032 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-08 13:12:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-08 13:12:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:49,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:49,033 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:49,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 13:12:49,034 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-08 13:12:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:49,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989369323] [2022-04-08 13:12:49,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-08 13:12:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:49,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102669428] [2022-04-08 13:12:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:49,121 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-08 13:12:49,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:49,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:49,122 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-08 13:12:49,122 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-08 13:12:49,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:49,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:49,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-08 13:12:49,123 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-08 13:12:49,124 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-08 13:12:49,124 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-08 13:12:49,125 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-08 13:12:49,125 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-08 13:12:49,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-08 13:12:49,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 13:12:49,126 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-08 13:12:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102669428] [2022-04-08 13:12:49,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102669428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:49,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:49,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:49,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:49,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989369323] [2022-04-08 13:12:49,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989369323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:49,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:49,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505719052] [2022-04-08 13:12:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:49,129 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-08 13:12:49,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:49,129 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-08 13:12:49,138 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-08 13:12:49,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:49,139 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-08 13:12:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,392 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 13:12:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:49,393 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-08 13:12:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:49,394 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-08 13:12:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:49,398 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-08 13:12:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:49,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:49,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:49,446 INFO L225 Difference]: With dead ends: 41 [2022-04-08 13:12:49,446 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 13:12:49,447 INFO L912 BasicCegarLoop]: 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-08 13:12:49,449 INFO L913 BasicCegarLoop]: 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-08 13:12:49,449 INFO L914 BasicCegarLoop]: 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-08 13:12:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 13:12:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 13:12:49,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:49,459 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-08 13:12:49,460 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-08 13:12:49,460 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-08 13:12:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,464 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:49,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:49,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:49,469 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-08 13:12:49,471 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-08 13:12:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,478 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:49,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:49,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:49,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:49,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:49,480 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-08 13:12:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 13:12:49,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-08 13:12:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:49,483 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 13:12:49,483 INFO L479 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-08 13:12:49,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-08 13:12:49,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 13:12:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 13:12:49,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:49,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:49,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 13:12:49,517 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-08 13:12:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:49,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966812871] [2022-04-08 13:12:49,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-08 13:12:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006698474] [2022-04-08 13:12:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:49,609 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-08 13:12:49,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:49,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:49,611 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-08 13:12:49,611 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-08 13:12:49,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:49,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:49,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:49,613 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-08 13:12:49,614 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-08 13:12:49,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {502#false} is VALID [2022-04-08 13:12:49,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-08 13:12:49,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 20);havoc #t~post6; {502#false} is VALID [2022-04-08 13:12:49,620 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-08 13:12:49,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-08 13:12:49,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-08 13:12:49,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-08 13:12:49,621 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-08 13:12:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:49,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006698474] [2022-04-08 13:12:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006698474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:49,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:49,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:49,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966812871] [2022-04-08 13:12:49,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966812871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:49,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:49,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854196539] [2022-04-08 13:12:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:49,622 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-08 13:12:49,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:49,623 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-08 13:12:49,638 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-08 13:12:49,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:49,640 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-08 13:12:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,787 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-08 13:12:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:49,788 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-08 13:12:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:49,788 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-08 13:12:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:49,790 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-08 13:12:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:49,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 13:12:49,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:49,836 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:49,836 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 13:12:49,837 INFO L912 BasicCegarLoop]: 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-08 13:12:49,839 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:49,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 13:12:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 13:12:49,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:49,856 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-08 13:12:49,856 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-08 13:12:49,857 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-08 13:12:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,861 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:49,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:49,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:49,862 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-08 13:12:49,864 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-08 13:12:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:49,875 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:49,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:49,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:49,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:49,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:49,876 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-08 13:12:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 13:12:49,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 13:12:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:49,877 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 13:12:49,878 INFO L479 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-08 13:12:49,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 13:12:49,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 13:12:49,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:49,912 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:49,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 13:12:49,914 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-08 13:12:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:49,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548623311] [2022-04-08 13:12:49,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-08 13:12:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862837927] [2022-04-08 13:12:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:50,008 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-08 13:12:50,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:50,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 13:12:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:50,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:50,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:50,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:50,015 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-08 13:12:50,016 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-08 13:12:50,016 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-08 13:12:50,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:50,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:50,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-08 13:12:50,017 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-08 13:12:50,017 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-08 13:12:50,018 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-08 13:12:50,018 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-08 13:12:50,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:50,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:50,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:50,019 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-08 13:12:50,020 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-08 13:12:50,020 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-08 13:12:50,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-08 13:12:50,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-08 13:12:50,021 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-08 13:12:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862837927] [2022-04-08 13:12:50,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862837927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:50,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:50,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:50,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:50,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548623311] [2022-04-08 13:12:50,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548623311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:50,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:50,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376637768] [2022-04-08 13:12:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:50,023 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-08 13:12:50,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:50,023 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-08 13:12:50,032 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-08 13:12:50,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:50,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:50,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:50,033 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-08 13:12:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,280 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 13:12:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:50,281 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-08 13:12:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:50,281 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-08 13:12:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:50,284 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-08 13:12:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:50,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:50,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:50,330 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:50,330 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 13:12:50,331 INFO L912 BasicCegarLoop]: 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-08 13:12:50,332 INFO L913 BasicCegarLoop]: 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-08 13:12:50,335 INFO L914 BasicCegarLoop]: 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-08 13:12:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 13:12:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-08 13:12:50,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:50,350 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-08 13:12:50,350 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-08 13:12:50,350 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-08 13:12:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,354 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:50,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:50,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:50,354 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-08 13:12:50,355 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-08 13:12:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,358 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:50,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:50,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:50,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:50,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:50,359 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-08 13:12:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-08 13:12:50,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-08 13:12:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:50,363 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-08 13:12:50,364 INFO L479 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-08 13:12:50,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-08 13:12:50,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-08 13:12:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 13:12:50,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:50,389 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:50,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 13:12:50,389 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-08 13:12:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:50,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55267761] [2022-04-08 13:12:50,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-08 13:12:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:50,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225200326] [2022-04-08 13:12:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:50,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242404162] [2022-04-08 13:12:50,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:50,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:50,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:12:50,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 13:12:50,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:50,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:50,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:12:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:50,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:50,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-08 13:12:50,709 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-08 13:12:50,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:50,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-08 13:12:50,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-08 13:12:50,710 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-08 13:12:50,711 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-08 13:12:50,723 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-08 13:12:50,723 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-08 13:12:50,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:50,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:50,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:50,724 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-08 13:12:50,725 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-08 13:12:50,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:50,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:50,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:50,726 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-08 13:12:50,726 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-08 13:12:50,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:50,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-08 13:12:50,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-08 13:12:50,728 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-08 13:12:50,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:50,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225200326] [2022-04-08 13:12:50,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:50,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242404162] [2022-04-08 13:12:50,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242404162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:50,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:50,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:50,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55267761] [2022-04-08 13:12:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55267761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:50,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:50,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:50,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088163062] [2022-04-08 13:12:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:50,730 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-08 13:12:50,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:50,730 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-08 13:12:50,747 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-08 13:12:50,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:50,748 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-08 13:12:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,921 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 13:12:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:50,921 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-08 13:12:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:50,922 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-08 13:12:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:50,923 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-08 13:12:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:50,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-08 13:12:50,975 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-08 13:12:50,976 INFO L225 Difference]: With dead ends: 65 [2022-04-08 13:12:50,976 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 13:12:50,976 INFO L912 BasicCegarLoop]: 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-08 13:12:50,978 INFO L913 BasicCegarLoop]: 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-08 13:12:50,978 INFO L914 BasicCegarLoop]: 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-08 13:12:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 13:12:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 13:12:50,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:50,991 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-08 13:12:50,993 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-08 13:12:50,994 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-08 13:12:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,996 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:50,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:50,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:50,997 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-08 13:12:50,997 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-08 13:12:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:50,999 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:50,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:50,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:50,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:50,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:51,000 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-08 13:12:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 13:12:51,002 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-08 13:12:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:51,002 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 13:12:51,002 INFO L479 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-08 13:12:51,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 13:12:51,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:12:51,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:51,048 INFO L499 BasicCegarLoop]: 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-08 13:12:51,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 13:12:51,266 WARN L460 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-08 13:12:51,268 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-08 13:12:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:51,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250076432] [2022-04-08 13:12:51,269 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-08 13:12:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:51,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258251263] [2022-04-08 13:12:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:51,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:51,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837124720] [2022-04-08 13:12:51,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:51,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:51,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:12:51,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 13:12:51,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:51,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:51,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:51,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:51,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-08 13:12:51,516 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-08 13:12:51,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:51,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:51,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:51,517 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-08 13:12:51,518 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-08 13:12:51,518 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-08 13:12:51,518 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-08 13:12:51,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,521 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,522 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-08 13:12:51,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,523 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-08 13:12:51,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,525 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:51,526 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-08 13:12:51,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1411#false} is VALID [2022-04-08 13:12:51,527 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-08 13:12:51,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-08 13:12:51,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-08 13:12:51,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-08 13:12:51,535 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-08 13:12:51,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:51,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258251263] [2022-04-08 13:12:51,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:51,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837124720] [2022-04-08 13:12:51,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837124720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:51,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:51,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:51,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250076432] [2022-04-08 13:12:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250076432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:51,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724357547] [2022-04-08 13:12:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:51,536 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-08 13:12:51,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:51,537 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-08 13:12:51,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:51,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:51,552 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-08 13:12:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:51,636 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-08 13:12:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:51,636 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-08 13:12:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:51,637 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-08 13:12:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:12:51,639 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-08 13:12:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:12:51,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 13:12:51,673 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-08 13:12:51,675 INFO L225 Difference]: With dead ends: 70 [2022-04-08 13:12:51,675 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 13:12:51,675 INFO L912 BasicCegarLoop]: 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-08 13:12:51,676 INFO L913 BasicCegarLoop]: 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-08 13:12:51,676 INFO L914 BasicCegarLoop]: 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-08 13:12:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 13:12:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 13:12:51,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:51,702 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-08 13:12:51,702 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-08 13:12:51,702 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-08 13:12:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:51,704 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:12:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:12:51,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:51,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:51,706 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-08 13:12:51,706 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-08 13:12:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:51,708 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:12:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:12:51,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:51,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:51,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:51,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:51,709 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-08 13:12:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-08 13:12:51,710 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-08 13:12:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:51,711 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-08 13:12:51,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 13:12:51,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-08 13:12:51,762 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-08 13:12:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-08 13:12:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:12:51,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:51,762 INFO L499 BasicCegarLoop]: 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-08 13:12:51,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 13:12:51,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 13:12:51,975 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-08 13:12:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:51,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859824684] [2022-04-08 13:12:51,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-08 13:12:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:51,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601349161] [2022-04-08 13:12:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:51,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:51,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708337098] [2022-04-08 13:12:51,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:51,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:52,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:12:52,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 13:12:52,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:52,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:52,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:52,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:52,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-08 13:12:52,180 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-08 13:12:52,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:52,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-08 13:12:52,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-08 13:12:52,183 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-08 13:12:52,183 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-08 13:12:52,184 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-08 13:12:52,184 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-08 13:12:52,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:52,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:52,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:52,185 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-08 13:12:52,185 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-08 13:12:52,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:52,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:52,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:52,185 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-08 13:12:52,186 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-08 13:12:52,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:52,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:52,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:52,186 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-08 13:12:52,187 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-08 13:12:52,187 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-08 13:12:52,188 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-08 13:12:52,188 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-08 13:12:52,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:52,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-08 13:12:52,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-08 13:12:52,189 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-08 13:12:52,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601349161] [2022-04-08 13:12:52,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708337098] [2022-04-08 13:12:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708337098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:52,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:52,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:52,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859824684] [2022-04-08 13:12:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859824684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:52,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:52,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049569918] [2022-04-08 13:12:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:52,191 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-08 13:12:52,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:52,191 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-08 13:12:52,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:52,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:52,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:52,207 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-08 13:12:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:52,363 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 13:12:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:52,363 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-08 13:12:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:52,363 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-08 13:12:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:12:52,364 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-08 13:12:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:12:52,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 13:12:52,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:52,399 INFO L225 Difference]: With dead ends: 76 [2022-04-08 13:12:52,399 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 13:12:52,400 INFO L912 BasicCegarLoop]: 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-08 13:12:52,400 INFO L913 BasicCegarLoop]: 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-08 13:12:52,400 INFO L914 BasicCegarLoop]: 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-08 13:12:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 13:12:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-08 13:12:52,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:52,433 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-08 13:12:52,434 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-08 13:12:52,434 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-08 13:12:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:52,436 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:12:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:12:52,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:52,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:52,436 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-08 13:12:52,436 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-08 13:12:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:52,438 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:12:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:12:52,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:52,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:52,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:52,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:52,439 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-08 13:12:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-08 13:12:52,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-08 13:12:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:52,441 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-08 13:12:52,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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-08 13:12:52,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-08 13:12:52,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-08 13:12:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 13:12:52,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:52,524 INFO L499 BasicCegarLoop]: 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-08 13:12:52,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 13:12:52,741 WARN L460 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-08 13:12:52,741 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-08 13:12:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:52,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825025522] [2022-04-08 13:12:56,902 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:56,902 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-08 13:12:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:56,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587210169] [2022-04-08 13:12:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:56,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:56,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307078789] [2022-04-08 13:12:56,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:56,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:12:56,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 13:12:57,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:57,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:57,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:57,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:57,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:12:57,149 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-08 13:12:57,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:57,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:57,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:57,150 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-08 13:12:57,150 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-08 13:12:57,151 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-08 13:12:57,151 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-08 13:12:57,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,153 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,153 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-08 13:12:57,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,154 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,155 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-08 13:12:57,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:57,157 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-08 13:12:57,157 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-08 13:12:57,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:12:57,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 20);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:12:57,158 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-08 13:12:57,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:12:57,158 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-08 13:12:57,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:12:57,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:12:57,159 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-08 13:12:57,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:57,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:12:57,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:12:57,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:57,301 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-08 13:12:57,301 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:12:57,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:57,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:57,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:57,302 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-08 13:12:57,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 20);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:12:57,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:12:57,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:12:57,303 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-08 13:12:57,303 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-08 13:12:57,303 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #82#return; {2549#(< ~counter~0 20)} is VALID [2022-04-08 13:12:57,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:57,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:57,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:57,304 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-08 13:12:57,304 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #80#return; {2549#(< ~counter~0 20)} is VALID [2022-04-08 13:12:57,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:57,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:57,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:57,305 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-08 13:12:57,305 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 20)} #78#return; {2549#(< ~counter~0 20)} is VALID [2022-04-08 13:12:57,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:57,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:57,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:57,306 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-08 13:12:57,306 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-08 13:12:57,306 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-08 13:12:57,307 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-08 13:12:57,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 19)} call #t~ret7 := main(); {2604#(< ~counter~0 19)} is VALID [2022-04-08 13:12:57,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 19)} {2396#true} #92#return; {2604#(< ~counter~0 19)} is VALID [2022-04-08 13:12:57,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 19)} assume true; {2604#(< ~counter~0 19)} is VALID [2022-04-08 13:12:57,308 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-08 13:12:57,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:12:57,308 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-08 13:12:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:57,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587210169] [2022-04-08 13:12:57,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:57,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307078789] [2022-04-08 13:12:57,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307078789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:57,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:57,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 13:12:57,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:57,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825025522] [2022-04-08 13:12:57,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825025522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:57,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:57,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578061427] [2022-04-08 13:12:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:57,310 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-08 13:12:57,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:57,310 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-08 13:12:57,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:12:57,330 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-08 13:12:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,443 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-08 13:12:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:57,444 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-08 13:12:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:57,444 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-08 13:12:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:12:57,445 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-08 13:12:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:12:57,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-08 13:12:57,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,492 INFO L225 Difference]: With dead ends: 90 [2022-04-08 13:12:57,492 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 13:12:57,493 INFO L912 BasicCegarLoop]: 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-08 13:12:57,493 INFO L913 BasicCegarLoop]: 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-08 13:12:57,493 INFO L914 BasicCegarLoop]: 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-08 13:12:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 13:12:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 13:12:57,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:57,524 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-08 13:12:57,524 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-08 13:12:57,524 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-08 13:12:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,526 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:12:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:57,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:57,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:57,527 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-08 13:12:57,527 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-08 13:12:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,529 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:12:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:57,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:57,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:57,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:57,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:57,529 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-08 13:12:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-08 13:12:57,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-08 13:12:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:57,531 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-08 13:12:57,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-08 13:12:57,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-08 13:12:57,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 13:12:57,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:57,599 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:57,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 13:12:57,817 WARN L460 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-08 13:12:57,817 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-08 13:12:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918961053] [2022-04-08 13:13:01,953 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:01,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-08 13:13:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:01,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158937954] [2022-04-08 13:13:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:01,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:01,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467881559] [2022-04-08 13:13:01,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:01,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:01,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:01,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:01,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 13:13:02,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:02,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:02,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:13:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:02,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:02,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:13:02,262 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-08 13:13:02,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:13:02,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:13:02,263 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-08 13:13:02,263 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-08 13:13:02,264 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-08 13:13:02,264 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-08 13:13:02,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,265 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-08 13:13:02,265 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-08 13:13:02,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,266 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-08 13:13:02,266 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-08 13:13:02,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,267 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-08 13:13:02,268 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-08 13:13:02,270 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-08 13:13:02,271 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-08 13:13:02,272 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-08 13:13:02,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,276 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-08 13:13:02,276 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-08 13:13:02,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,277 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-08 13:13:02,277 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-08 13:13:02,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:02,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:13:02,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:13:02,278 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-08 13:13:02,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:02,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:13:02,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:13:02,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:02,439 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-08 13:13:02,439 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-08 13:13:02,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,439 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-08 13:13:02,440 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-08 13:13:02,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,440 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-08 13:13:02,440 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-08 13:13:02,441 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-08 13:13:02,443 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-08 13:13:02,444 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-08 13:13:02,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,444 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-08 13:13:02,444 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-08 13:13:02,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,445 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-08 13:13:02,445 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-08 13:13:02,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:02,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:02,446 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-08 13:13:02,446 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-08 13:13:02,446 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-08 13:13:02,447 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-08 13:13:02,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:13:02,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:13:02,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:02,448 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-08 13:13:02,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:13:02,450 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-08 13:13:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158937954] [2022-04-08 13:13:02,451 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467881559] [2022-04-08 13:13:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467881559] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 13:13:02,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:13:02,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 13:13:02,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918961053] [2022-04-08 13:13:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918961053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:02,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:02,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:13:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360862881] [2022-04-08 13:13:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:02,452 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-08 13:13:02,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:02,452 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-08 13:13:02,468 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-08 13:13:02,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:13:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:13:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:13:02,468 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-08 13:13:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:04,655 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 13:13:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:13:04,655 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-08 13:13:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:04,656 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-08 13:13:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:13:04,657 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-08 13:13:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:13:04,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 13:13:04,703 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-08 13:13:04,705 INFO L225 Difference]: With dead ends: 78 [2022-04-08 13:13:04,705 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 13:13:04,705 INFO L912 BasicCegarLoop]: 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-08 13:13:04,706 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:04,706 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 13:13:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-08 13:13:04,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:04,746 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-08 13:13:04,746 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-08 13:13:04,747 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-08 13:13:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:04,749 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:13:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:13:04,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:04,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:04,750 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-08 13:13:04,750 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-08 13:13:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:04,752 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:13:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:13:04,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:04,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:04,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:04,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:04,753 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-08 13:13:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-08 13:13:04,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-08 13:13:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:04,756 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-08 13:13:04,756 INFO L479 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-08 13:13:04,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-08 13:13:04,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-08 13:13:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 13:13:04,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:04,838 INFO L499 BasicCegarLoop]: 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-08 13:13:04,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:05,039 WARN L460 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-08 13:13:05,039 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-08 13:13:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702415910] [2022-04-08 13:13:06,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:06,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-08 13:13:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389271493] [2022-04-08 13:13:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:06,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503113029] [2022-04-08 13:13:06,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:06,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:06,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 13:13:06,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:06,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:06,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:13:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:06,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:06,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:13:06,885 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-08 13:13:06,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:06,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:06,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:06,886 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-08 13:13:06,887 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-08 13:13:06,887 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-08 13:13:06,890 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-08 13:13:06,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,891 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,892 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-08 13:13:06,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,893 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,894 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-08 13:13:06,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,898 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:06,898 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-08 13:13:06,899 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-08 13:13:06,899 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-08 13:13:06,900 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-08 13:13:06,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,901 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,902 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-08 13:13:06,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,903 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,904 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-08 13:13:06,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,909 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:06,910 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-08 13:13:06,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:13:06,911 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-08 13:13:06,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:06,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-08 13:13:06,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-08 13:13:06,911 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:13:06,911 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-08 13:13:06,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:06,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:13:06,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:13:06,912 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-08 13:13:06,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:07,157 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-08 13:13:07,157 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,158 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-08 13:13:07,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:13:07,158 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-08 13:13:07,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 20)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 20)} is VALID [2022-04-08 13:13:07,159 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #82#return; {3965#(< ~counter~0 20)} is VALID [2022-04-08 13:13:07,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,160 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-08 13:13:07,160 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #80#return; {3965#(< ~counter~0 20)} is VALID [2022-04-08 13:13:07,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,160 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-08 13:13:07,165 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 20)} #78#return; {3965#(< ~counter~0 20)} is VALID [2022-04-08 13:13:07,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,166 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-08 13:13:07,166 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-08 13:13:07,166 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-08 13:13:07,167 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-08 13:13:07,167 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #82#return; {4020#(< ~counter~0 19)} is VALID [2022-04-08 13:13:07,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,168 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-08 13:13:07,168 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #80#return; {4020#(< ~counter~0 19)} is VALID [2022-04-08 13:13:07,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,169 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-08 13:13:07,169 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 19)} #78#return; {4020#(< ~counter~0 19)} is VALID [2022-04-08 13:13:07,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:07,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:07,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:07,169 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-08 13:13:07,170 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-08 13:13:07,170 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-08 13:13:07,171 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-08 13:13:07,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 18)} call #t~ret7 := main(); {4075#(< ~counter~0 18)} is VALID [2022-04-08 13:13:07,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 18)} {3769#true} #92#return; {4075#(< ~counter~0 18)} is VALID [2022-04-08 13:13:07,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 18)} assume true; {4075#(< ~counter~0 18)} is VALID [2022-04-08 13:13:07,173 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-08 13:13:07,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:13:07,173 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-08 13:13:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:07,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389271493] [2022-04-08 13:13:07,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:07,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503113029] [2022-04-08 13:13:07,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503113029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:07,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:07,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 13:13:07,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702415910] [2022-04-08 13:13:07,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702415910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:07,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:07,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:13:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670098909] [2022-04-08 13:13:07,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:07,175 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-08 13:13:07,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:07,175 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-08 13:13:07,205 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-08 13:13:07,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:13:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:13:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:13:07,206 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-08 13:13:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:07,379 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-08 13:13:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:13:07,379 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-08 13:13:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:07,379 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-08 13:13:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:13:07,380 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-08 13:13:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:13:07,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-08 13:13:07,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:07,428 INFO L225 Difference]: With dead ends: 104 [2022-04-08 13:13:07,428 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 13:13:07,428 INFO L912 BasicCegarLoop]: 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-08 13:13:07,429 INFO L913 BasicCegarLoop]: 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-08 13:13:07,429 INFO L914 BasicCegarLoop]: 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-08 13:13:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 13:13:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-08 13:13:07,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:07,494 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-08 13:13:07,494 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-08 13:13:07,495 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-08 13:13:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:07,498 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:13:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:13:07,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:07,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:07,499 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-08 13:13:07,499 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-08 13:13:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:07,500 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:13:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:13:07,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:07,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:07,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:07,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:07,502 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-08 13:13:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-08 13:13:07,503 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-08 13:13:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:07,503 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-08 13:13:07,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-08 13:13:07,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-08 13:13:07,604 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-08 13:13:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-08 13:13:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 13:13:07,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:07,604 INFO L499 BasicCegarLoop]: 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-08 13:13:07,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:07,805 WARN L460 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-08 13:13:07,805 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-08 13:13:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:07,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622733847] [2022-04-08 13:13:11,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:11,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-08 13:13:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001273118] [2022-04-08 13:13:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:11,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:11,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818620529] [2022-04-08 13:13:11,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:13:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:11,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:11,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 13:13:12,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:13:12,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:12,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:13:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:12,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-08 13:13:12,244 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-08 13:13:12,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:12,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:12,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:12,246 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-08 13:13:12,246 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-08 13:13:12,246 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-08 13:13:12,247 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-08 13:13:12,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,248 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,248 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-08 13:13:12,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,250 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,250 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-08 13:13:12,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,251 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:12,252 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-08 13:13:12,252 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-08 13:13:12,252 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-08 13:13:12,253 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-08 13:13:12,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,254 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,254 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-08 13:13:12,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,256 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,256 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-08 13:13:12,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,257 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:12,258 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-08 13:13:12,258 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-08 13:13:12,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {4671#false} is VALID [2022-04-08 13:13:12,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 20);havoc #t~post6; {4671#false} is VALID [2022-04-08 13:13:12,259 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-08 13:13:12,259 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-08 13:13:12,259 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-08 13:13:12,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-08 13:13:12,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-08 13:13:12,259 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-08 13:13:12,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:12,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-08 13:13:12,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-08 13:13:12,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:13:12,496 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-08 13:13:12,497 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-08 13:13:12,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,497 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-08 13:13:12,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 20);havoc #t~post6; {4671#false} is VALID [2022-04-08 13:13:12,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-08 13:13:12,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4671#false} is VALID [2022-04-08 13:13:12,498 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-08 13:13:12,498 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-08 13:13:12,498 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #82#return; {4878#(< ~counter~0 20)} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,499 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-08 13:13:12,499 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #80#return; {4878#(< ~counter~0 20)} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,500 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-08 13:13:12,500 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 20)} #78#return; {4878#(< ~counter~0 20)} is VALID [2022-04-08 13:13:12,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,500 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-08 13:13:12,500 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-08 13:13:12,501 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-08 13:13:12,501 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-08 13:13:12,502 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #82#return; {4933#(< ~counter~0 19)} is VALID [2022-04-08 13:13:12,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,502 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-08 13:13:12,504 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #80#return; {4933#(< ~counter~0 19)} is VALID [2022-04-08 13:13:12,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,509 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-08 13:13:12,510 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 19)} #78#return; {4933#(< ~counter~0 19)} is VALID [2022-04-08 13:13:12,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:13:12,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:13:12,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:13:12,510 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-08 13:13:12,511 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-08 13:13:12,512 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-08 13:13:12,512 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-08 13:13:12,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 18)} call #t~ret7 := main(); {4988#(< ~counter~0 18)} is VALID [2022-04-08 13:13:12,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 18)} {4670#true} #92#return; {4988#(< ~counter~0 18)} is VALID [2022-04-08 13:13:12,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 18)} assume true; {4988#(< ~counter~0 18)} is VALID [2022-04-08 13:13:12,513 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-08 13:13:12,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-08 13:13:12,514 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-08 13:13:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:12,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001273118] [2022-04-08 13:13:12,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818620529] [2022-04-08 13:13:12,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818620529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:12,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:12,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 13:13:12,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622733847] [2022-04-08 13:13:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622733847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:13:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288790524] [2022-04-08 13:13:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:12,519 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-08 13:13:12,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:12,519 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-08 13:13:12,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:12,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:13:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:13:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:13:12,549 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-08 13:13:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,721 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-08 13:13:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:13:12,721 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-08 13:13:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:12,722 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-08 13:13:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:13:12,723 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-08 13:13:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:13:12,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 13:13:12,788 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-08 13:13:12,789 INFO L225 Difference]: With dead ends: 126 [2022-04-08 13:13:12,789 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 13:13:12,790 INFO L912 BasicCegarLoop]: 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-08 13:13:12,790 INFO L913 BasicCegarLoop]: 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-08 13:13:12,791 INFO L914 BasicCegarLoop]: 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-08 13:13:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 13:13:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 13:13:12,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:12,853 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-08 13:13:12,853 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-08 13:13:12,853 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-08 13:13:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,855 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:13:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:12,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:12,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:12,856 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-08 13:13:12,856 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-08 13:13:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,858 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:13:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:12,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:12,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:12,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:12,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:12,858 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-08 13:13:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-08 13:13:12,861 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-08 13:13:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:12,861 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-08 13:13:12,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 13:13:12,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-08 13:13:12,999 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-08 13:13:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:13:13,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:13,000 INFO L499 BasicCegarLoop]: 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-08 13:13:13,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:13,200 WARN L460 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-08 13:13:13,201 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-08 13:13:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:13,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526935352] [2022-04-08 13:13:15,658 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:15,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-08 13:13:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:15,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284044465] [2022-04-08 13:13:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:15,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974158957] [2022-04-08 13:13:15,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:15,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:15,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:15,669 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:15,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 13:13:15,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:15,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:15,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:13:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:15,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-08 13:13:15,993 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-08 13:13:15,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:15,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:15,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:15,995 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-08 13:13:15,995 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-08 13:13:15,996 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-08 13:13:15,996 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-08 13:13:15,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,997 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,998 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-08 13:13:15,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:15,999 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:16,000 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-08 13:13:16,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:16,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:16,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:16,001 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:16,001 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-08 13:13:16,002 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-08 13:13:16,002 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-08 13:13:16,003 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-08 13:13:16,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,004 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,004 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-08 13:13:16,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,005 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,006 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-08 13:13:16,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,007 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:16,008 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-08 13:13:16,008 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-08 13:13:16,009 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-08 13:13:16,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,010 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,011 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-08 13:13:16,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,012 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:16,012 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-08 13:13:16,013 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-08 13:13:16,013 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-08 13:13:16,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {5638#false} is VALID [2022-04-08 13:13:16,013 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-08 13:13:16,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-08 13:13:16,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-08 13:13:16,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-08 13:13:16,014 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-08 13:13:16,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:16,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-08 13:13:16,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-08 13:13:16,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-08 13:13:16,321 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-08 13:13:16,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5638#false} is VALID [2022-04-08 13:13:16,321 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-08 13:13:16,322 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-08 13:13:16,322 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-08 13:13:16,323 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 20)} #86#return; {5846#(< ~counter~0 20)} is VALID [2022-04-08 13:13:16,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,323 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-08 13:13:16,323 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 20)} #84#return; {5846#(< ~counter~0 20)} is VALID [2022-04-08 13:13:16,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,324 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-08 13:13:16,324 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-08 13:13:16,325 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-08 13:13:16,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 19)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 19)} is VALID [2022-04-08 13:13:16,325 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #82#return; {5889#(< ~counter~0 19)} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,326 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-08 13:13:16,326 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #80#return; {5889#(< ~counter~0 19)} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,327 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-08 13:13:16,327 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 19)} #78#return; {5889#(< ~counter~0 19)} is VALID [2022-04-08 13:13:16,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,327 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-08 13:13:16,328 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-08 13:13:16,328 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-08 13:13:16,328 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-08 13:13:16,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #82#return; {5944#(< ~counter~0 18)} is VALID [2022-04-08 13:13:16,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,329 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-08 13:13:16,330 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #80#return; {5944#(< ~counter~0 18)} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,330 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-08 13:13:16,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 18)} #78#return; {5944#(< ~counter~0 18)} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:13:16,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:13:16,331 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-08 13:13:16,331 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-08 13:13:16,331 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-08 13:13:16,332 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-08 13:13:16,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 17)} call #t~ret7 := main(); {5999#(< ~counter~0 17)} is VALID [2022-04-08 13:13:16,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 17)} {5637#true} #92#return; {5999#(< ~counter~0 17)} is VALID [2022-04-08 13:13:16,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 17)} assume true; {5999#(< ~counter~0 17)} is VALID [2022-04-08 13:13:16,333 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-08 13:13:16,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-08 13:13:16,333 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-08 13:13:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284044465] [2022-04-08 13:13:16,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974158957] [2022-04-08 13:13:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974158957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:16,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 13:13:16,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526935352] [2022-04-08 13:13:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526935352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:16,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:13:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016532468] [2022-04-08 13:13:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:16,335 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-08 13:13:16,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:16,335 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-08 13:13:16,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:16,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:13:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:16,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:13:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:13:16,370 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-08 13:13:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:16,660 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-08 13:13:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:13:16,660 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-08 13:13:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:16,660 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-08 13:13:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:13:16,662 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-08 13:13:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:13:16,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 13:13:16,726 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-08 13:13:16,727 INFO L225 Difference]: With dead ends: 145 [2022-04-08 13:13:16,728 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 13:13:16,728 INFO L912 BasicCegarLoop]: 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-08 13:13:16,728 INFO L913 BasicCegarLoop]: 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-08 13:13:16,728 INFO L914 BasicCegarLoop]: 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-08 13:13:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 13:13:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-08 13:13:16,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:16,809 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-08 13:13:16,809 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-08 13:13:16,810 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-08 13:13:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:16,812 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:13:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:13:16,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:16,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:16,813 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-08 13:13:16,813 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-08 13:13:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:16,815 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:13:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:13:16,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:16,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:16,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:16,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:16,816 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-08 13:13:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-08 13:13:16,818 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-08 13:13:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:16,818 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-08 13:13:16,818 INFO L479 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-08 13:13:16,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-08 13:13:16,949 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-08 13:13:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-08 13:13:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:13:16,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:16,950 INFO L499 BasicCegarLoop]: 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-08 13:13:16,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:17,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 13:13:17,150 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-08 13:13:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438879342] [2022-04-08 13:13:20,168 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:20,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-08 13:13:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:20,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613206669] [2022-04-08 13:13:20,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:20,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246792534] [2022-04-08 13:13:20,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:20,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:20,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 13:13:20,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:20,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:20,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 13:13:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:20,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:20,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-08 13:13:20,677 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-08 13:13:20,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-08 13:13:20,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-08 13:13:20,678 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-08 13:13:20,679 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-08 13:13:20,679 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-08 13:13:20,679 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-08 13:13:20,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,680 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-08 13:13:20,680 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-08 13:13:20,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,681 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-08 13:13:20,681 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-08 13:13:20,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,682 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-08 13:13:20,682 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-08 13:13:20,683 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-08 13:13:20,683 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-08 13:13:20,683 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-08 13:13:20,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,684 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-08 13:13:20,684 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-08 13:13:20,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,685 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-08 13:13:20,685 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-08 13:13:20,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,686 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-08 13:13:20,686 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-08 13:13:20,687 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-08 13:13:20,687 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-08 13:13:20,687 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-08 13:13:20,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,688 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-08 13:13:20,688 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-08 13:13:20,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:20,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:20,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:20,689 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-08 13:13:20,689 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-08 13:13:20,690 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-08 13:13:20,690 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-08 13:13:20,691 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-08 13:13:20,691 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-08 13:13:20,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:20,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-08 13:13:20,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-08 13:13:20,692 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-08 13:13:20,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:21,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-08 13:13:21,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-08 13:13:21,831 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:21,832 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-08 13:13:21,832 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-08 13:13:21,832 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-08 13:13:21,845 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-08 13:13:21,864 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-08 13:13:21,865 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-08 13:13:21,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,866 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-08 13:13:21,866 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-08 13:13:21,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,867 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-08 13:13:21,868 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-08 13:13:21,869 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-08 13:13:21,870 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-08 13:13:21,870 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-08 13:13:21,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,871 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-08 13:13:21,871 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-08 13:13:21,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,871 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-08 13:13:21,872 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-08 13:13:21,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,872 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-08 13:13:21,873 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-08 13:13:21,874 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-08 13:13:21,881 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-08 13:13:21,882 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-08 13:13:21,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,882 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-08 13:13:21,883 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-08 13:13:21,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,883 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-08 13:13:21,883 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-08 13:13:21,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:13:21,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:13:21,884 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-08 13:13:21,884 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-08 13:13:21,884 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-08 13:13:21,885 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-08 13:13:21,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-08 13:13:21,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-08 13:13:21,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:13:21,885 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-08 13:13:21,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-08 13:13:21,886 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-08 13:13:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613206669] [2022-04-08 13:13:21,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246792534] [2022-04-08 13:13:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246792534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:21,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:21,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 13:13:21,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:21,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438879342] [2022-04-08 13:13:21,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438879342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:21,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:21,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:13:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667276341] [2022-04-08 13:13:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:21,887 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-08 13:13:21,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:21,888 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-08 13:13:21,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:21,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:13:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:13:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:13:21,936 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-08 13:13:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:22,571 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-08 13:13:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 13:13:22,571 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-08 13:13:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:22,572 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-08 13:13:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:13:22,574 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-08 13:13:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:13:22,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-08 13:13:22,663 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-08 13:13:22,665 INFO L225 Difference]: With dead ends: 181 [2022-04-08 13:13:22,666 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 13:13:22,666 INFO L912 BasicCegarLoop]: 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-08 13:13:22,666 INFO L913 BasicCegarLoop]: 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-08 13:13:22,667 INFO L914 BasicCegarLoop]: 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-08 13:13:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 13:13:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 13:13:22,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:22,751 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-08 13:13:22,751 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-08 13:13:22,752 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-08 13:13:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:22,754 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:13:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:13:22,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:22,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:22,755 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-08 13:13:22,755 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-08 13:13:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:22,757 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:13:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:13:22,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:22,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:22,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:22,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:22,758 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-08 13:13:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-08 13:13:22,761 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-08 13:13:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:22,761 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-08 13:13:22,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-08 13:13:22,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-08 13:13:22,910 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-08 13:13:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-08 13:13:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 13:13:22,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:22,911 INFO L499 BasicCegarLoop]: 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-08 13:13:22,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:23,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 13:13:23,111 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-08 13:13:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:23,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634250851] [2022-04-08 13:13:25,363 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:25,364 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-08 13:13:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181486806] [2022-04-08 13:13:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:25,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:25,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960380493] [2022-04-08 13:13:25,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:13:25,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:25,390 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:25,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 13:13:25,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:13:25,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:25,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 13:13:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:25,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:27,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-08 13:13:27,493 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-08 13:13:27,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-08 13:13:27,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-08 13:13:27,493 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-08 13:13:27,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-08 13:13:27,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 20);havoc #t~post5; {8115#true} is VALID [2022-04-08 13:13:27,494 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-08 13:13:27,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,494 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-08 13:13:27,494 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-08 13:13:27,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:27,495 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-08 13:13:27,495 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-08 13:13:27,496 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-08 13:13:27,496 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-08 13:13:27,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,496 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-08 13:13:27,497 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-08 13:13:27,498 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-08 13:13:27,498 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-08 13:13:27,498 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-08 13:13:27,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:27,499 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-08 13:13:27,499 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-08 13:13:27,499 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-08 13:13:27,500 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-08 13:13:27,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,500 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-08 13:13:27,500 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-08 13:13:27,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,501 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-08 13:13:27,501 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-08 13:13:27,502 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-08 13:13:27,502 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-08 13:13:27,502 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-08 13:13:27,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,503 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-08 13:13:27,503 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-08 13:13:27,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:13:27,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:13:27,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:13:27,504 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-08 13:13:27,505 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-08 13:13:27,506 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-08 13:13:27,506 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-08 13:13:27,507 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-08 13:13:27,507 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-08 13:13:27,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:27,507 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-08 13:13:27,508 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-08 13:13:27,510 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-08 13:13:27,512 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-08 13:13:27,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:27,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-08 13:13:27,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-08 13:13:27,513 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-08 13:13:27,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:37,544 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 13:13:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:55,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181486806] [2022-04-08 13:13:55,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:55,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960380493] [2022-04-08 13:13:55,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960380493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 13:13:55,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:13:55,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 13:13:55,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:55,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634250851] [2022-04-08 13:13:55,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634250851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:55,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:55,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 13:13:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790311190] [2022-04-08 13:13:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:55,637 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-08 13:13:55,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:55,637 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-08 13:13:55,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:55,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 13:13:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:55,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 13:13:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-08 13:13:55,691 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-08 13:13:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:56,729 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-08 13:13:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 13:13:56,729 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-08 13:13:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:56,729 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-08 13:13:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-08 13:13:56,732 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-08 13:13:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-08 13:13:56,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-08 13:13:56,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:56,866 INFO L225 Difference]: With dead ends: 188 [2022-04-08 13:13:56,866 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 13:13:56,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:13:56,867 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:56,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-04-08 13:13:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 13:13:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 13:13:57,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:57,023 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-08 13:13:57,024 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-08 13:13:57,024 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-08 13:13:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:57,027 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-08 13:13:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-08 13:13:57,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:57,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:57,028 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-08 13:13:57,028 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-08 13:13:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:57,032 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-08 13:13:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-08 13:13:57,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:57,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:57,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:57,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:57,033 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-08 13:13:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-08 13:13:57,036 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-08 13:13:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:57,037 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-08 13:13:57,037 INFO L479 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-08 13:13:57,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-08 13:13:57,210 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-08 13:13:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-08 13:13:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 13:13:57,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:57,211 INFO L499 BasicCegarLoop]: 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-08 13:13:57,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:57,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 13:13:57,428 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-08 13:13:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:57,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374562245] [2022-04-08 13:14:00,012 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:14:00,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:14:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-08 13:14:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:14:00,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468970717] [2022-04-08 13:14:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:14:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:14:00,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:14:00,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862702273] [2022-04-08 13:14:00,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:14:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:14:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:14:00,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:14:00,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 13:14:00,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:14:00,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:14:00,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 13:14:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:14:00,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:14:00,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-08 13:14:00,711 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-08 13:14:00,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-08 13:14:00,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-08 13:14:00,712 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-08 13:14:00,712 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-08 13:14:00,712 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-08 13:14:00,713 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-08 13:14:00,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,713 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-08 13:14:00,713 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-08 13:14:00,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:00,714 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-08 13:14:00,714 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-08 13:14:00,715 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-08 13:14:00,715 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-08 13:14:00,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,716 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-08 13:14:00,716 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-08 13:14:00,717 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-08 13:14:00,717 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-08 13:14:00,717 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-08 13:14:00,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,718 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-08 13:14:00,718 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-08 13:14:00,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,719 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-08 13:14:00,719 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-08 13:14:00,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,720 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-08 13:14:00,720 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-08 13:14:00,720 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-08 13:14:00,721 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-08 13:14:00,721 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-08 13:14:00,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,722 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-08 13:14:00,722 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-08 13:14:00,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:00,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:00,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:00,722 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-08 13:14:00,723 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-08 13:14:00,723 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-08 13:14:00,724 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-08 13:14:00,724 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-08 13:14:00,724 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-08 13:14:00,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:00,725 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-08 13:14:00,725 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-08 13:14:00,726 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-08 13:14:00,726 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-08 13:14:00,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:00,727 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-08 13:14:00,727 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-08 13:14:00,728 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-08 13:14:00,728 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-08 13:14:00,729 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-08 13:14:00,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:00,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-08 13:14:00,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-08 13:14:00,731 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-08 13:14:00,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:13,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-08 13:14:13,162 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-08 13:14:13,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:13,163 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-08 13:14:13,164 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-08 13:14:13,164 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-08 13:14:13,165 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-08 13:14:13,165 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-08 13:14:13,165 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-08 13:14:13,165 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-08 13:14:13,167 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-08 13:14:13,167 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-08 13:14:13,168 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-08 13:14:13,168 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-08 13:14:13,168 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-08 13:14:13,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 20);havoc #t~post6; {9367#true} is VALID [2022-04-08 13:14:13,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-08 13:14:13,168 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-08 13:14:13,168 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-08 13:14:13,169 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,169 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-08 13:14:13,169 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,169 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-08 13:14:13,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 20);havoc #t~post6; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-08 13:14:13,169 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,170 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-08 13:14:13,170 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,170 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-08 13:14:13,170 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,170 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-08 13:14:13,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 20);havoc #t~post5; {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-08 13:14:13,171 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-08 13:14:13,171 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,171 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-08 13:14:13,171 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,171 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-08 13:14:13,171 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:14:13,172 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-08 13:14:13,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 20);havoc #t~post5; {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-08 13:14:13,172 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-08 13:14:13,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-08 13:14:13,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:14:13,172 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-08 13:14:13,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-08 13:14:13,173 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-08 13:14:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:14:13,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468970717] [2022-04-08 13:14:13,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:14:13,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862702273] [2022-04-08 13:14:13,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862702273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:14:13,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:14:13,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 13:14:13,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:14:13,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374562245] [2022-04-08 13:14:13,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374562245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:14:13,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:14:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 13:14:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145432558] [2022-04-08 13:14:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:14:13,174 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-08 13:14:13,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:14:13,174 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-08 13:14:13,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:14:13,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 13:14:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 13:14:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-08 13:14:13,213 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-08 13:14:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:14,090 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-08 13:14:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:14:14,090 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-08 13:14:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:14:14,090 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-08 13:14:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:14:14,091 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-08 13:14:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:14:14,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 13:14:14,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:14:14,167 INFO L225 Difference]: With dead ends: 186 [2022-04-08 13:14:14,167 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 13:14:14,167 INFO L912 BasicCegarLoop]: 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-08 13:14:14,168 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 13:14:14,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 13:14:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 13:14:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-08 13:14:14,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:14:14,264 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-08 13:14:14,264 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-08 13:14:14,265 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-08 13:14:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:14,267 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-08 13:14:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:14:14,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:14,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:14,267 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-08 13:14:14,267 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-08 13:14:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:14,269 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-08 13:14:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:14:14,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:14,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:14,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:14:14,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:14:14,270 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-08 13:14:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-08 13:14:14,272 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-08 13:14:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:14:14,272 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-08 13:14:14,272 INFO L479 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-08 13:14:14,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-08 13:14:14,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:14:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:14:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 13:14:14,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:14:14,419 INFO L499 BasicCegarLoop]: 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-08 13:14:14,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 13:14:14,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 13:14:14,620 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:14:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:14:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-08 13:14:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000582811] [2022-04-08 13:14:18,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:14:18,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:14:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-08 13:14:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:14:18,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893348630] [2022-04-08 13:14:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:14:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:14:18,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:14:18,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375019366] [2022-04-08 13:14:18,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:14:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:14:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:14:18,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:14:18,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 13:14:18,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 13:14:18,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:14:18,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:14:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:14:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:14:19,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-08 13:14:19,014 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-08 13:14:19,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:19,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:19,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:19,016 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-08 13:14:19,017 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-08 13:14:19,017 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-08 13:14:19,017 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-08 13:14:19,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,019 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,019 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-08 13:14:19,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,020 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,021 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-08 13:14:19,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,022 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:19,023 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-08 13:14:19,023 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-08 13:14:19,024 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-08 13:14:19,024 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-08 13:14:19,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,025 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,026 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-08 13:14:19,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,027 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,028 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-08 13:14:19,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,029 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:19,030 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-08 13:14:19,030 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-08 13:14:19,030 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-08 13:14:19,031 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-08 13:14:19,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,032 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,033 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-08 13:14:19,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,034 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,034 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-08 13:14:19,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,036 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:19,036 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-08 13:14:19,036 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-08 13:14:19,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 20);havoc #t~post6; {10713#false} is VALID [2022-04-08 13:14:19,037 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-08 13:14:19,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-08 13:14:19,037 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-08 13:14:19,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:14:19,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-08 13:14:19,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-08 13:14:19,038 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-08 13:14:19,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:19,325 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-08 13:14:19,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-08 13:14:19,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:14:19,325 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-08 13:14:19,325 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-08 13:14:19,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,326 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-08 13:14:19,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 20);havoc #t~post6; {10713#false} is VALID [2022-04-08 13:14:19,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-08 13:14:19,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10713#false} is VALID [2022-04-08 13:14:19,326 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-08 13:14:19,327 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-08 13:14:19,327 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #82#return; {10975#(< ~counter~0 20)} is VALID [2022-04-08 13:14:19,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,328 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-08 13:14:19,328 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #80#return; {10975#(< ~counter~0 20)} is VALID [2022-04-08 13:14:19,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,328 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-08 13:14:19,329 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 20)} #78#return; {10975#(< ~counter~0 20)} is VALID [2022-04-08 13:14:19,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,329 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-08 13:14:19,329 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-08 13:14:19,330 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-08 13:14:19,330 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-08 13:14:19,331 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #82#return; {11030#(< ~counter~0 19)} is VALID [2022-04-08 13:14:19,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,331 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-08 13:14:19,331 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #80#return; {11030#(< ~counter~0 19)} is VALID [2022-04-08 13:14:19,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,332 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-08 13:14:19,332 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 19)} #78#return; {11030#(< ~counter~0 19)} is VALID [2022-04-08 13:14:19,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,332 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-08 13:14:19,332 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-08 13:14:19,333 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-08 13:14:19,333 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-08 13:14:19,334 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #82#return; {11085#(< ~counter~0 18)} is VALID [2022-04-08 13:14:19,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,334 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-08 13:14:19,334 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #80#return; {11085#(< ~counter~0 18)} is VALID [2022-04-08 13:14:19,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,335 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-08 13:14:19,335 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 18)} #78#return; {11085#(< ~counter~0 18)} is VALID [2022-04-08 13:14:19,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:14:19,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:14:19,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:14:19,335 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-08 13:14:19,336 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-08 13:14:19,336 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-08 13:14:19,336 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-08 13:14:19,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 17)} call #t~ret7 := main(); {11140#(< ~counter~0 17)} is VALID [2022-04-08 13:14:19,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 17)} {10712#true} #92#return; {11140#(< ~counter~0 17)} is VALID [2022-04-08 13:14:19,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 17)} assume true; {11140#(< ~counter~0 17)} is VALID [2022-04-08 13:14:19,338 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-08 13:14:19,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-08 13:14:19,338 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-08 13:14:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:14:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893348630] [2022-04-08 13:14:19,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:14:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375019366] [2022-04-08 13:14:19,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375019366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:14:19,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:14:19,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 13:14:19,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:14:19,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000582811] [2022-04-08 13:14:19,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000582811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:14:19,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:14:19,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:14:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012800782] [2022-04-08 13:14:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:14:19,339 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-08 13:14:19,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:14:19,340 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-08 13:14:19,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:14:19,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:14:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:14:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:14:19,377 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-08 13:14:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:19,599 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-08 13:14:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 13:14:19,600 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-08 13:14:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:14:19,600 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-08 13:14:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 13:14:19,601 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-08 13:14:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 13:14:19,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-08 13:14:19,664 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-08 13:14:19,666 INFO L225 Difference]: With dead ends: 170 [2022-04-08 13:14:19,666 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 13:14:19,666 INFO L912 BasicCegarLoop]: 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-08 13:14:19,666 INFO L913 BasicCegarLoop]: 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-08 13:14:19,667 INFO L914 BasicCegarLoop]: 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-08 13:14:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 13:14:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 13:14:19,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:14:19,767 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-08 13:14:19,767 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-08 13:14:19,768 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-08 13:14:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:19,770 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-08 13:14:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:14:19,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:19,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:19,770 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-08 13:14:19,772 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-08 13:14:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:19,773 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-08 13:14:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:14:19,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:19,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:19,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:14:19,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:14:19,774 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-08 13:14:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-08 13:14:19,776 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-08 13:14:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:14:19,778 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-08 13:14:19,778 INFO L479 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-08 13:14:19,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-08 13:14:19,927 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-08 13:14:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:14:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 13:14:19,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:14:19,928 INFO L499 BasicCegarLoop]: 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-08 13:14:19,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 13:14:20,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 13:14:20,128 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:14:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:14:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-08 13:14:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:20,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635847129] [2022-04-08 13:14:24,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:14:24,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:14:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-08 13:14:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:14:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212290125] [2022-04-08 13:14:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:14:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:14:24,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:14:24,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389064333] [2022-04-08 13:14:24,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:14:24,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:14:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:14:24,207 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:14:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 13:14:24,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:14:24,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:14:24,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:14:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:14:24,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:14:24,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-08 13:14:24,540 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-08 13:14:24,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:24,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:24,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:14:24,541 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-08 13:14:24,542 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-08 13:14:24,542 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-08 13:14:24,542 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-08 13:14:24,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,543 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,544 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-08 13:14:24,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,545 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,545 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-08 13:14:24,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,546 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:14:24,546 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-08 13:14:24,547 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-08 13:14:24,547 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-08 13:14:24,547 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-08 13:14:24,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,548 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,549 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-08 13:14:24,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,550 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,550 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-08 13:14:24,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,551 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:14:24,551 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-08 13:14:24,552 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-08 13:14:24,552 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-08 13:14:24,552 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-08 13:14:24,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,553 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,554 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-08 13:14:24,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,555 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,555 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-08 13:14:24,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,558 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:14:24,559 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-08 13:14:24,559 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-08 13:14:24,559 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-08 13:14:24,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,561 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,561 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-08 13:14:24,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,562 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:14:24,562 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-08 13:14:24,562 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-08 13:14:24,579 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-08 13:14:24,580 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {12032#false} is VALID [2022-04-08 13:14:24,580 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-08 13:14:24,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-08 13:14:24,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-08 13:14:24,580 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-08 13:14:24,581 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-08 13:14:24,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:24,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-08 13:14:24,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-08 13:14:24,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-08 13:14:24,944 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-08 13:14:24,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12032#false} is VALID [2022-04-08 13:14:24,944 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-08 13:14:24,945 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-08 13:14:24,945 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-08 13:14:24,945 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 20)} #86#return; {12295#(< ~counter~0 20)} is VALID [2022-04-08 13:14:24,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,946 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-08 13:14:24,946 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 20)} #84#return; {12295#(< ~counter~0 20)} is VALID [2022-04-08 13:14:24,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,946 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-08 13:14:24,947 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-08 13:14:24,947 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-08 13:14:24,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 19)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 19)} is VALID [2022-04-08 13:14:24,948 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #82#return; {12338#(< ~counter~0 19)} is VALID [2022-04-08 13:14:24,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,948 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-08 13:14:24,949 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #80#return; {12338#(< ~counter~0 19)} is VALID [2022-04-08 13:14:24,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,949 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-08 13:14:24,950 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 19)} #78#return; {12338#(< ~counter~0 19)} is VALID [2022-04-08 13:14:24,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,950 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-08 13:14:24,950 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-08 13:14:24,951 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-08 13:14:24,951 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-08 13:14:24,952 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #82#return; {12393#(< ~counter~0 18)} is VALID [2022-04-08 13:14:24,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,952 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-08 13:14:24,952 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #80#return; {12393#(< ~counter~0 18)} is VALID [2022-04-08 13:14:24,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,953 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-08 13:14:24,953 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 18)} #78#return; {12393#(< ~counter~0 18)} is VALID [2022-04-08 13:14:24,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,953 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-08 13:14:24,954 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-08 13:14:24,954 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-08 13:14:24,954 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-08 13:14:24,955 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #82#return; {12448#(< ~counter~0 17)} is VALID [2022-04-08 13:14:24,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,955 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-08 13:14:24,956 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #80#return; {12448#(< ~counter~0 17)} is VALID [2022-04-08 13:14:24,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,956 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-08 13:14:24,957 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 17)} #78#return; {12448#(< ~counter~0 17)} is VALID [2022-04-08 13:14:24,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:14:24,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:14:24,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:14:24,957 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-08 13:14:24,958 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-08 13:14:24,958 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-08 13:14:24,958 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-08 13:14:24,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 16)} call #t~ret7 := main(); {12503#(< ~counter~0 16)} is VALID [2022-04-08 13:14:24,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 16)} {12031#true} #92#return; {12503#(< ~counter~0 16)} is VALID [2022-04-08 13:14:24,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 16)} assume true; {12503#(< ~counter~0 16)} is VALID [2022-04-08 13:14:24,960 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-08 13:14:24,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-08 13:14:24,960 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-08 13:14:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:14:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212290125] [2022-04-08 13:14:24,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:14:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389064333] [2022-04-08 13:14:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389064333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:14:24,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:14:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 13:14:24,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:14:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635847129] [2022-04-08 13:14:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635847129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:14:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:14:24,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:14:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103966076] [2022-04-08 13:14:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:14:24,973 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-08 13:14:24,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:14:24,973 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-08 13:14:25,017 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-08 13:14:25,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:14:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:14:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:14:25,018 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-08 13:14:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:25,421 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-08 13:14:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:14:25,422 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-08 13:14:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:14:25,422 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-08 13:14:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-08 13:14:25,423 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-08 13:14:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-08 13:14:25,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-08 13:14:25,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:14:25,502 INFO L225 Difference]: With dead ends: 181 [2022-04-08 13:14:25,502 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 13:14:25,502 INFO L912 BasicCegarLoop]: 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-08 13:14:25,502 INFO L913 BasicCegarLoop]: 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-08 13:14:25,503 INFO L914 BasicCegarLoop]: 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-08 13:14:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 13:14:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-08 13:14:25,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:14:25,676 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-08 13:14:25,685 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-08 13:14:25,687 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-08 13:14:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:25,692 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-08 13:14:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-08 13:14:25,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:25,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:25,707 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-08 13:14:25,707 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-08 13:14:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:14:25,710 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-08 13:14:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-08 13:14:25,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:14:25,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:14:25,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:14:25,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:14:25,710 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-08 13:14:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-08 13:14:25,713 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-08 13:14:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:14:25,714 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-08 13:14:25,714 INFO L479 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-08 13:14:25,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-08 13:14:25,896 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-08 13:14:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-08 13:14:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 13:14:25,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:14:25,897 INFO L499 BasicCegarLoop]: 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-08 13:14:25,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 13:14:26,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 13:14:26,098 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:14:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:14:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-08 13:14:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:14:26,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460253073] [2022-04-08 13:14:28,185 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:14:28,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:14:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-08 13:14:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:14:28,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904356246] [2022-04-08 13:14:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:14:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:14:28,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:14:28,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574843103] [2022-04-08 13:14:28,198 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:14:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:14:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:14:28,199 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:14:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 13:14:28,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 13:14:28,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:14:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 13:14:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:14:28,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:14:28,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-08 13:14:28,917 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-08 13:14:28,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-08 13:14:28,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-08 13:14:28,918 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-08 13:14:28,918 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-08 13:14:28,919 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-08 13:14:28,919 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-08 13:14:28,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,920 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-08 13:14:28,920 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-08 13:14:28,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,920 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-08 13:14:28,920 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-08 13:14:28,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,921 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-08 13:14:28,921 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-08 13:14:28,922 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-08 13:14:28,922 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-08 13:14:28,922 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-08 13:14:28,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,923 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-08 13:14:28,923 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-08 13:14:28,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,923 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-08 13:14:28,924 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-08 13:14:28,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,924 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-08 13:14:28,925 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-08 13:14:28,926 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-08 13:14:28,926 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-08 13:14:28,926 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-08 13:14:28,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,927 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-08 13:14:28,927 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-08 13:14:28,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,927 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-08 13:14:28,927 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-08 13:14:28,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:28,928 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-08 13:14:28,928 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-08 13:14:28,929 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-08 13:14:28,929 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-08 13:14:28,930 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-08 13:14:28,930 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-08 13:14:28,930 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-08 13:14:28,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,930 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,931 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-08 13:14:28,931 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-08 13:14:28,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:28,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:28,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:28,931 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-08 13:14:28,933 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-08 13:14:28,934 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-08 13:14:28,934 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-08 13:14:28,934 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-08 13:14:28,935 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-08 13:14:28,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:28,936 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-08 13:14:28,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-08 13:14:28,936 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-08 13:14:28,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:50,118 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse4 (= (mod c_main_~p~0 2) 0)) (.cse8 (< c_main_~p~0 0)) (.cse9 (div c_main_~p~0 2))) (let ((.cse7 (< c_main_~d~0 0)) (.cse6 (= (mod c_main_~d~0 2) 0)) (.cse3 (* (+ c_main_~q~0 .cse9 1) c_main_~B~0)) (.cse5 (not .cse8)) (.cse0 (* (- 1) (div c_main_~d~0 2))) (.cse1 (* (+ c_main_~q~0 .cse9) c_main_~B~0)) (.cse2 (and (not .cse4) .cse8))) (and (or (and (or (= c_main_~A~0 (+ (- 1) c_main_~r~0 .cse0 .cse1)) .cse2) (or (= c_main_~A~0 (+ (- 1) .cse3 c_main_~r~0 .cse0)) .cse4 .cse5)) .cse6 (not .cse7)) (or (and .cse7 (not .cse6)) (and (or (= (+ .cse3 c_main_~r~0 .cse0) c_main_~A~0) .cse4 .cse5) (or (= c_main_~A~0 (+ c_main_~r~0 .cse0 .cse1)) .cse2)))))) (not (= (* c_main_~p~0 c_main_~B~0) c_main_~d~0))) is different from true [2022-04-08 13:15:58,287 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-08 13:15:58,287 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-08 13:15:58,287 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:15:58,288 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-08 13:15:58,288 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-08 13:15:58,289 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-08 13:15:58,304 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-08 13:15:58,320 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-08 13:15:58,321 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-08 13:15:58,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,321 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-08 13:15:58,322 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-08 13:15:58,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,322 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-08 13:15:58,323 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-08 13:15:58,324 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-08 13:15:58,325 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-08 13:15:58,325 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-08 13:15:58,326 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-08 13:15:58,326 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-08 13:15:58,326 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-08 13:15:58,326 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-08 13:15:58,327 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-08 13:15:58,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,327 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-08 13:15:58,328 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-08 13:15:58,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,328 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-08 13:15:58,330 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-08 13:15:58,331 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-08 13:15:58,335 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-08 13:15:58,336 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-08 13:15:58,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,336 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-08 13:15:58,337 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-08 13:15:58,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,337 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-08 13:15:58,337 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-08 13:15:58,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,338 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-08 13:15:58,349 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-08 13:15:58,350 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-08 13:15:58,350 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-08 13:15:58,351 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-08 13:15:58,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,351 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-08 13:15:58,351 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-08 13:15:58,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,352 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-08 13:15:58,352 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-08 13:15:58,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:58,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:58,352 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-08 13:15:58,353 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-08 13:15:58,353 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-08 13:15:58,353 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-08 13:15:58,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-08 13:15:58,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-08 13:15:58,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:58,354 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-08 13:15:58,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-08 13:15:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 196 trivial. 10 not checked. [2022-04-08 13:15:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:15:58,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904356246] [2022-04-08 13:15:58,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:15:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574843103] [2022-04-08 13:15:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574843103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:15:58,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:15:58,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-08 13:15:58,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:15:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460253073] [2022-04-08 13:15:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460253073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:15:58,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:15:58,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 13:15:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341328510] [2022-04-08 13:15:58,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:15:58,356 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-08 13:15:58,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:15:58,356 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-08 13:15:58,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:58,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 13:15:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 13:15:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=162, Unknown=1, NotChecked=26, Total=240 [2022-04-08 13:15:58,393 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-08 13:15:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:59,148 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-08 13:15:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:15:59,148 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-08 13:15:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:15:59,149 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-08 13:15:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:15:59,151 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-08 13:15:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:15:59,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 13:15:59,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:59,272 INFO L225 Difference]: With dead ends: 193 [2022-04-08 13:15:59,273 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 13:15:59,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=64, Invalid=211, Unknown=1, NotChecked=30, Total=306 [2022-04-08 13:15:59,273 INFO L913 BasicCegarLoop]: 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-08 13:15:59,273 INFO L914 BasicCegarLoop]: 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-08 13:15:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 13:15:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-08 13:15:59,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:15:59,415 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-08 13:15:59,416 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-08 13:15:59,416 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-08 13:15:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:59,418 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-08 13:15:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-08 13:15:59,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:59,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:59,420 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-08 13:15:59,420 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-08 13:15:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:59,423 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-08 13:15:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-08 13:15:59,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:59,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:59,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:15:59,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:15:59,425 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-08 13:15:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-08 13:15:59,428 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-08 13:15:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:15:59,428 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-08 13:15:59,429 INFO L479 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-08 13:15:59,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-08 13:15:59,727 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-08 13:15:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-08 13:15:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 13:15:59,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:15:59,728 INFO L499 BasicCegarLoop]: 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-08 13:15:59,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 13:15:59,945 WARN L460 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-08 13:15:59,946 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:15:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:15:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-08 13:15:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080275923] [2022-04-08 13:16:02,037 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:16:02,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:16:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-08 13:16:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:16:02,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006047185] [2022-04-08 13:16:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:16:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:16:02,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:16:02,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295840313] [2022-04-08 13:16:02,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:16:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:16:02,054 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:16:02,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 13:16:02,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:16:02,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:16:02,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 13:16:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:16:02,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:16:03,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-08 13:16:03,769 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-08 13:16:03,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-08 13:16:03,769 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-08 13:16:03,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 20);havoc #t~post5; {15115#true} is VALID [2022-04-08 13:16:03,769 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-08 13:16:03,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,769 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-08 13:16:03,769 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-08 13:16:03,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-08 13:16:03,770 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-08 13:16:03,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-08 13:16:03,771 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-08 13:16:03,771 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-08 13:16:03,771 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-08 13:16:03,771 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-08 13:16:03,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,772 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-08 13:16:03,772 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-08 13:16:03,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,773 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-08 13:16:03,773 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-08 13:16:03,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,773 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-08 13:16:03,774 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-08 13:16:03,775 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-08 13:16:03,775 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-08 13:16:03,775 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-08 13:16:03,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,776 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-08 13:16:03,776 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-08 13:16:03,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,776 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-08 13:16:03,776 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-08 13:16:03,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,777 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-08 13:16:03,777 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-08 13:16:03,778 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-08 13:16:03,778 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-08 13:16:03,778 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-08 13:16:03,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,779 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-08 13:16:03,779 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-08 13:16:03,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,780 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-08 13:16:03,781 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-08 13:16:03,781 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-08 13:16:03,781 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-08 13:16:03,781 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-08 13:16:03,781 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-08 13:16:03,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,782 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-08 13:16:03,782 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-08 13:16:03,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,783 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-08 13:16:03,783 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-08 13:16:03,783 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-08 13:16:03,783 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-08 13:16:03,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-08 13:16:03,783 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-08 13:16:03,784 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-08 13:16:03,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:16:03,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-08 13:16:03,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-08 13:16:03,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-08 13:16:03,987 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-08 13:16:03,987 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-08 13:16:03,987 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-08 13:16:03,987 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,987 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,988 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-08 13:16:03,988 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-08 13:16:03,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,988 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,988 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,988 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-08 13:16:03,989 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-08 13:16:03,989 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-08 13:16:03,989 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-08 13:16:03,990 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-08 13:16:03,990 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-08 13:16:03,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,990 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,990 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,990 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-08 13:16:03,991 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-08 13:16:03,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,991 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-08 13:16:03,991 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-08 13:16:03,992 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-08 13:16:03,992 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-08 13:16:03,992 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-08 13:16:03,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,993 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-08 13:16:03,993 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-08 13:16:03,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,993 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-08 13:16:03,994 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-08 13:16:03,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,994 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-08 13:16:03,994 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-08 13:16:03,994 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-08 13:16:03,995 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-08 13:16:03,996 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-08 13:16:03,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,996 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-08 13:16:03,996 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-08 13:16:03,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,997 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-08 13:16:03,997 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-08 13:16:03,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,997 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-08 13:16:03,997 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-08 13:16:03,998 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-08 13:16:03,998 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-08 13:16:03,998 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-08 13:16:03,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,998 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-08 13:16:03,998 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-08 13:16:03,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,999 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-08 13:16:03,999 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:16:03,999 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-08 13:16:03,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 20);havoc #t~post5; {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-08 13:16:03,999 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-08 13:16:03,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-08 13:16:03,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:16:04,000 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-08 13:16:04,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-08 13:16:04,000 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-08 13:16:04,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:16:04,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006047185] [2022-04-08 13:16:04,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:16:04,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295840313] [2022-04-08 13:16:04,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295840313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:16:04,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:16:04,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-08 13:16:04,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:16:04,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080275923] [2022-04-08 13:16:04,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080275923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:16:04,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:16:04,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:16:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083445591] [2022-04-08 13:16:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:16:04,001 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-08 13:16:04,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:16:04,001 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-08 13:16:04,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:04,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 13:16:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 13:16:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:16:04,043 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-08 13:16:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:04,282 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-08 13:16:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 13:16:04,282 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-08 13:16:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:16:04,282 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-08 13:16:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 13:16:04,283 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-08 13:16:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 13:16:04,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 13:16:04,347 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-08 13:16:04,350 INFO L225 Difference]: With dead ends: 197 [2022-04-08 13:16:04,350 INFO L226 Difference]: Without dead ends: 184 [2022-04-08 13:16:04,350 INFO L912 BasicCegarLoop]: 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-08 13:16:04,350 INFO L913 BasicCegarLoop]: 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-08 13:16:04,350 INFO L914 BasicCegarLoop]: 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-08 13:16:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-08 13:16:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-08 13:16:04,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:16:04,509 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-08 13:16:04,509 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-08 13:16:04,509 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-08 13:16:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:04,512 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-08 13:16:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-08 13:16:04,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:04,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:04,513 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-08 13:16:04,513 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-08 13:16:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:04,516 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-08 13:16:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-08 13:16:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:04,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:16:04,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:16:04,517 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-08 13:16:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-08 13:16:04,519 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-08 13:16:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:16:04,519 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-08 13:16:04,520 INFO L479 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-08 13:16:04,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-08 13:16:04,732 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-08 13:16:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-08 13:16:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 13:16:04,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:16:04,733 INFO L499 BasicCegarLoop]: 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-08 13:16:04,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 13:16:04,933 WARN L460 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-08 13:16:04,933 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:16:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:16:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-08 13:16:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:04,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134721950] [2022-04-08 13:16:09,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:16:09,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:16:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-08 13:16:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:16:09,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76101656] [2022-04-08 13:16:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:16:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:16:09,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:16:09,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218241603] [2022-04-08 13:16:09,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:16:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:09,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:16:09,024 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:16:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 13:16:09,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:16:09,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:16:09,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:16:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:16:09,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:16:09,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-08 13:16:09,472 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-08 13:16:09,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:09,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:09,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:09,474 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-08 13:16:09,475 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-08 13:16:09,475 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-08 13:16:09,475 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-08 13:16:09,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,477 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,477 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-08 13:16:09,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,479 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,479 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-08 13:16:09,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,481 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:09,481 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-08 13:16:09,482 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-08 13:16:09,482 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-08 13:16:09,483 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-08 13:16:09,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,484 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,484 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-08 13:16:09,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,486 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,486 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-08 13:16:09,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,487 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:09,488 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-08 13:16:09,488 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-08 13:16:09,489 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-08 13:16:09,489 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-08 13:16:09,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,490 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,491 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-08 13:16:09,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,492 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,493 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-08 13:16:09,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,494 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:09,494 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-08 13:16:09,495 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-08 13:16:09,495 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-08 13:16:09,496 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-08 13:16:09,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,497 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,497 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-08 13:16:09,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,499 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,499 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-08 13:16:09,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,500 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,500 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:09,501 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-08 13:16:09,501 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-08 13:16:09,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 20);havoc #t~post6; {16789#false} is VALID [2022-04-08 13:16:09,502 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-08 13:16:09,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-08 13:16:09,502 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-08 13:16:09,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-08 13:16:09,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-08 13:16:09,503 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-08 13:16:09,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:16:09,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:16:09,909 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-08 13:16:09,909 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,909 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-08 13:16:09,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 20);havoc #t~post6; {16789#false} is VALID [2022-04-08 13:16:09,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-08 13:16:09,910 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {16789#false} is VALID [2022-04-08 13:16:09,910 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-08 13:16:09,910 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-08 13:16:09,911 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #82#return; {17106#(< ~counter~0 20)} is VALID [2022-04-08 13:16:09,911 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,911 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-08 13:16:09,912 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #80#return; {17106#(< ~counter~0 20)} is VALID [2022-04-08 13:16:09,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,912 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-08 13:16:09,913 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 20)} #78#return; {17106#(< ~counter~0 20)} is VALID [2022-04-08 13:16:09,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,913 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-08 13:16:09,913 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-08 13:16:09,914 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-08 13:16:09,914 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-08 13:16:09,915 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #82#return; {17161#(< ~counter~0 19)} is VALID [2022-04-08 13:16:09,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,915 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-08 13:16:09,916 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #80#return; {17161#(< ~counter~0 19)} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,916 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-08 13:16:09,916 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 19)} #78#return; {17161#(< ~counter~0 19)} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,917 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-08 13:16:09,917 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-08 13:16:09,917 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-08 13:16:09,918 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-08 13:16:09,918 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #82#return; {17216#(< ~counter~0 18)} is VALID [2022-04-08 13:16:09,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,919 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-08 13:16:09,919 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #80#return; {17216#(< ~counter~0 18)} is VALID [2022-04-08 13:16:09,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,919 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-08 13:16:09,920 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 18)} #78#return; {17216#(< ~counter~0 18)} is VALID [2022-04-08 13:16:09,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,920 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-08 13:16:09,920 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-08 13:16:09,921 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-08 13:16:09,921 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-08 13:16:09,922 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #82#return; {17271#(< ~counter~0 17)} is VALID [2022-04-08 13:16:09,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,922 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-08 13:16:09,922 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #80#return; {17271#(< ~counter~0 17)} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,923 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-08 13:16:09,923 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 17)} #78#return; {17271#(< ~counter~0 17)} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:16:09,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:16:09,923 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-08 13:16:09,924 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-08 13:16:09,924 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-08 13:16:09,925 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-08 13:16:09,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 16)} call #t~ret7 := main(); {17326#(< ~counter~0 16)} is VALID [2022-04-08 13:16:09,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 16)} {16788#true} #92#return; {17326#(< ~counter~0 16)} is VALID [2022-04-08 13:16:09,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 16)} assume true; {17326#(< ~counter~0 16)} is VALID [2022-04-08 13:16:09,926 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-08 13:16:09,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-08 13:16:09,926 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-08 13:16:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:16:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76101656] [2022-04-08 13:16:09,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:16:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218241603] [2022-04-08 13:16:09,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218241603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:16:09,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:16:09,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 13:16:09,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:16:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134721950] [2022-04-08 13:16:09,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134721950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:16:09,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:16:09,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:16:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816895989] [2022-04-08 13:16:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:16:09,928 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-08 13:16:09,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:16:09,928 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-08 13:16:09,978 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-08 13:16:09,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:16:09,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:16:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:16:09,979 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-08 13:16:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:10,359 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-08 13:16:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 13:16:10,359 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-08 13:16:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:16:10,360 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-08 13:16:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-08 13:16:10,361 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-08 13:16:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-08 13:16:10,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-08 13:16:10,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:10,448 INFO L225 Difference]: With dead ends: 242 [2022-04-08 13:16:10,448 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 13:16:10,448 INFO L912 BasicCegarLoop]: 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-08 13:16:10,449 INFO L913 BasicCegarLoop]: 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-08 13:16:10,449 INFO L914 BasicCegarLoop]: 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-08 13:16:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 13:16:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-08 13:16:10,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:16:10,592 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-08 13:16:10,592 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-08 13:16:10,592 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-08 13:16:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:10,595 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-08 13:16:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:16:10,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:10,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:10,596 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-08 13:16:10,596 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-08 13:16:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:10,599 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-08 13:16:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:16:10,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:10,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:10,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:16:10,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:16:10,600 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-08 13:16:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-08 13:16:10,603 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-08 13:16:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:16:10,603 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-08 13:16:10,603 INFO L479 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-08 13:16:10,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-08 13:16:10,865 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-08 13:16:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:16:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 13:16:10,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:16:10,866 INFO L499 BasicCegarLoop]: 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-08 13:16:10,884 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-08 13:16:11,066 WARN L460 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-08 13:16:11,066 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:16:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:16:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-08 13:16:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:11,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455836845] [2022-04-08 13:16:15,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:16:15,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:16:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-08 13:16:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:16:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748369360] [2022-04-08 13:16:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:16:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:16:15,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:16:15,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240532551] [2022-04-08 13:16:15,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:16:15,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:16:15,142 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:16:15,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 13:16:15,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 13:16:15,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:16:15,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 13:16:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:16:15,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:16:15,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-08 13:16:15,541 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-08 13:16:15,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:15,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:15,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:16:15,542 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-08 13:16:15,543 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-08 13:16:15,543 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-08 13:16:15,544 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-08 13:16:15,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,545 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,545 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-08 13:16:15,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,546 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,547 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-08 13:16:15,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,548 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:16:15,548 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-08 13:16:15,549 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-08 13:16:15,549 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-08 13:16:15,549 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-08 13:16:15,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,550 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,551 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-08 13:16:15,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,552 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,552 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-08 13:16:15,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,553 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:16:15,553 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-08 13:16:15,554 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-08 13:16:15,555 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-08 13:16:15,555 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-08 13:16:15,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,556 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,556 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-08 13:16:15,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,557 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,558 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-08 13:16:15,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,559 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:16:15,560 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-08 13:16:15,560 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-08 13:16:15,560 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-08 13:16:15,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,562 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,562 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-08 13:16:15,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,563 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:16:15,563 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-08 13:16:15,564 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-08 13:16:15,564 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-08 13:16:15,565 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-08 13:16:15,565 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-08 13:16:15,565 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,565 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,566 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,566 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-08 13:16:15,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,567 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,567 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,568 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:16:15,568 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-08 13:16:15,568 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-08 13:16:15,568 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-08 13:16:15,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {18568#false} is VALID [2022-04-08 13:16:15,569 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-08 13:16:15,569 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-08 13:16:15,569 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-08 13:16:15,569 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-08 13:16:15,569 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-08 13:16:15,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:16:15,891 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-08 13:16:15,891 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-08 13:16:15,891 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-08 13:16:15,891 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-08 13:16:15,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {18568#false} is VALID [2022-04-08 13:16:15,892 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-08 13:16:15,892 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-08 13:16:15,892 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-08 13:16:15,892 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 20)} #86#return; {18874#(< ~counter~0 20)} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,893 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-08 13:16:15,893 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 20)} #84#return; {18874#(< ~counter~0 20)} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,893 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,893 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-08 13:16:15,894 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-08 13:16:15,894 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-08 13:16:15,895 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-08 13:16:15,895 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-08 13:16:15,895 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 19)} #86#return; {18917#(< ~counter~0 19)} is VALID [2022-04-08 13:16:15,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,896 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-08 13:16:15,896 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 19)} #84#return; {18917#(< ~counter~0 19)} is VALID [2022-04-08 13:16:15,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,896 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-08 13:16:15,897 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-08 13:16:15,897 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-08 13:16:15,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 18)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 18)} is VALID [2022-04-08 13:16:15,898 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #82#return; {18960#(< ~counter~0 18)} is VALID [2022-04-08 13:16:15,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,898 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-08 13:16:15,898 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #80#return; {18960#(< ~counter~0 18)} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,899 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-08 13:16:15,899 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 18)} #78#return; {18960#(< ~counter~0 18)} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,899 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-08 13:16:15,900 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-08 13:16:15,900 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-08 13:16:15,901 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-08 13:16:15,901 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #82#return; {19015#(< ~counter~0 17)} is VALID [2022-04-08 13:16:15,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,901 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-08 13:16:15,902 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #80#return; {19015#(< ~counter~0 17)} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,902 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-08 13:16:15,902 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 17)} #78#return; {19015#(< ~counter~0 17)} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,902 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-08 13:16:15,903 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-08 13:16:15,903 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-08 13:16:15,904 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-08 13:16:15,904 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #82#return; {19070#(< ~counter~0 16)} is VALID [2022-04-08 13:16:15,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,904 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-08 13:16:15,905 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #80#return; {19070#(< ~counter~0 16)} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,905 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-08 13:16:15,905 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 16)} #78#return; {19070#(< ~counter~0 16)} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:16:15,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:16:15,906 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-08 13:16:15,906 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-08 13:16:15,906 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-08 13:16:15,907 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-08 13:16:15,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 15)} call #t~ret7 := main(); {19125#(< ~counter~0 15)} is VALID [2022-04-08 13:16:15,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 15)} {18567#true} #92#return; {19125#(< ~counter~0 15)} is VALID [2022-04-08 13:16:15,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 15)} assume true; {19125#(< ~counter~0 15)} is VALID [2022-04-08 13:16:15,908 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-08 13:16:15,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-08 13:16:15,908 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-08 13:16:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:16:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748369360] [2022-04-08 13:16:15,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:16:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240532551] [2022-04-08 13:16:15,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240532551] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:16:15,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:16:15,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 13:16:15,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:16:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455836845] [2022-04-08 13:16:15,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455836845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:16:15,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:16:15,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:16:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123304173] [2022-04-08 13:16:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:16:15,910 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-08 13:16:15,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:16:15,910 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-08 13:16:15,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:15,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 13:16:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 13:16:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 13:16:15,957 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-08 13:16:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:16,401 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-08 13:16:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 13:16:16,401 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-08 13:16:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:16:16,401 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-08 13:16:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-08 13:16:16,404 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-08 13:16:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-08 13:16:16,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-08 13:16:16,549 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-08 13:16:16,552 INFO L225 Difference]: With dead ends: 240 [2022-04-08 13:16:16,552 INFO L226 Difference]: Without dead ends: 227 [2022-04-08 13:16:16,552 INFO L912 BasicCegarLoop]: 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-08 13:16:16,553 INFO L913 BasicCegarLoop]: 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-08 13:16:16,553 INFO L914 BasicCegarLoop]: 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-08 13:16:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-08 13:16:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-08 13:16:16,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:16:16,762 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-08 13:16:16,763 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-08 13:16:16,763 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-08 13:16:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:16,766 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-08 13:16:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-08 13:16:16,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:16,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:16,767 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-08 13:16:16,768 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-08 13:16:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:16,771 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-08 13:16:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-08 13:16:16,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:16,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:16,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:16:16,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:16:16,772 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-08 13:16:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-08 13:16:16,776 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-08 13:16:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:16:16,776 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-08 13:16:16,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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-08 13:16:16,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-08 13:16:17,150 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-08 13:16:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-08 13:16:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 13:16:17,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:16:17,151 INFO L499 BasicCegarLoop]: 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-08 13:16:17,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 13:16:17,351 WARN L460 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-08 13:16:17,352 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:16:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:16:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-08 13:16:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:17,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746426978] [2022-04-08 13:16:21,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:16:21,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:16:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-08 13:16:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:16:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567821011] [2022-04-08 13:16:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:16:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:16:21,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:16:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262253426] [2022-04-08 13:16:21,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:16:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:16:21,454 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:16:21,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 13:16:21,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:16:21,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:16:21,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 13:16:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:16:21,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:16:22,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-08 13:16:22,282 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-08 13:16:22,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-08 13:16:22,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-08 13:16:22,282 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-08 13:16:22,283 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-08 13:16:22,283 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-08 13:16:22,283 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-08 13:16:22,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,284 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-08 13:16:22,284 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-08 13:16:22,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,285 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-08 13:16:22,285 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-08 13:16:22,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,286 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-08 13:16:22,286 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-08 13:16:22,287 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-08 13:16:22,287 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-08 13:16:22,287 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-08 13:16:22,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,288 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-08 13:16:22,288 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-08 13:16:22,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,289 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-08 13:16:22,289 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-08 13:16:22,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,290 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-08 13:16:22,290 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-08 13:16:22,291 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-08 13:16:22,291 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-08 13:16:22,291 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-08 13:16:22,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,292 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-08 13:16:22,292 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-08 13:16:22,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,293 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-08 13:16:22,293 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-08 13:16:22,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,293 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-08 13:16:22,294 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-08 13:16:22,294 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-08 13:16:22,295 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-08 13:16:22,295 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-08 13:16:22,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,295 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-08 13:16:22,296 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-08 13:16:22,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,296 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-08 13:16:22,297 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-08 13:16:22,297 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-08 13:16:22,298 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-08 13:16:22,298 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-08 13:16:22,298 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-08 13:16:22,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,298 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,299 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-08 13:16:22,299 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-08 13:16:22,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:22,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:22,299 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:22,300 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-08 13:16:22,301 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-08 13:16:22,302 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-08 13:16:22,302 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-08 13:16:22,303 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-08 13:16:22,303 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-08 13:16:22,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:16:22,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-08 13:16:22,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-08 13:16:22,304 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-08 13:16:22,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:16:55,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-08 13:16:55,195 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-08 13:16:55,195 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:16:55,196 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-08 13:16:55,196 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-08 13:16:55,196 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-08 13:16:55,207 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-08 13:16:55,227 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-08 13:16:55,227 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-08 13:16:55,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,228 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-08 13:16:55,228 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-08 13:16:55,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,229 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-08 13:16:55,230 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-08 13:16:55,231 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-08 13:16:55,252 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-08 13:16:55,615 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-08 13:16:55,616 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-08 13:16:55,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,616 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-08 13:16:55,617 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-08 13:16:55,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,618 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-08 13:16:55,622 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-08 13:16:55,627 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-08 13:16:55,632 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-08 13:16:55,633 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-08 13:16:55,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,634 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-08 13:16:55,634 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-08 13:16:55,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,635 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-08 13:16:55,636 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-08 13:16:55,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,636 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-08 13:16:55,641 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-08 13:16:55,646 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-08 13:16:55,862 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-08 13:16:55,863 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-08 13:16:55,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,863 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-08 13:16:55,864 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-08 13:16:55,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,864 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-08 13:16:55,865 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-08 13:16:55,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,865 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-08 13:16:55,866 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-08 13:16:55,868 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-08 13:16:55,893 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-08 13:16:55,894 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-08 13:16:55,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,894 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-08 13:16:55,895 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-08 13:16:55,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,895 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-08 13:16:55,896 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-08 13:16:55,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:55,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:55,896 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-08 13:16:55,896 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-08 13:16:55,897 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-08 13:16:55,897 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-08 13:16:55,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-08 13:16:55,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-08 13:16:55,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:55,897 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-08 13:16:55,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-08 13:16:55,899 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-08 13:16:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:16:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567821011] [2022-04-08 13:16:55,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:16:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262253426] [2022-04-08 13:16:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262253426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:16:55,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:16:55,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-08 13:16:55,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:16:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746426978] [2022-04-08 13:16:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746426978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:16:55,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:16:55,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 13:16:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632340693] [2022-04-08 13:16:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:16:55,900 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-08 13:16:55,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:16:55,900 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-08 13:16:55,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:55,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 13:16:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 13:16:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2022-04-08 13:16:55,965 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-08 13:16:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:57,476 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-08 13:16:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 13:16:57,476 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-08 13:16:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:16:57,476 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-08 13:16:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-08 13:16:57,478 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-08 13:16:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-08 13:16:57,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-08 13:16:57,612 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-08 13:16:57,616 INFO L225 Difference]: With dead ends: 275 [2022-04-08 13:16:57,616 INFO L226 Difference]: Without dead ends: 240 [2022-04-08 13:16:57,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-04-08 13:16:57,617 INFO L913 BasicCegarLoop]: 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-08 13:16:57,618 INFO L914 BasicCegarLoop]: 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-08 13:16:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-08 13:16:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-08 13:16:57,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:16:57,805 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-08 13:16:57,805 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-08 13:16:57,805 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-08 13:16:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:57,810 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-08 13:16:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-08 13:16:57,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:57,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:57,811 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-08 13:16:57,811 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-08 13:16:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:57,815 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-08 13:16:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-08 13:16:57,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:57,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:57,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:16:57,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:16:57,816 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-08 13:16:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-08 13:16:57,820 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-08 13:16:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:16:57,820 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-08 13:16:57,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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-08 13:16:57,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-08 13:16:58,223 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-08 13:16:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-08 13:16:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 13:16:58,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:16:58,225 INFO L499 BasicCegarLoop]: 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-08 13:16:58,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 13:16:58,425 WARN L460 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-08 13:16:58,425 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:16:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:16:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-08 13:16:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:58,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412253821] [2022-04-08 13:17:02,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:17:02,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:17:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-08 13:17:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:17:02,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084487346] [2022-04-08 13:17:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:17:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:17:02,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:17:02,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724589824] [2022-04-08 13:17:02,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:17:02,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:17:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:17:02,517 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:17:02,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 13:17:02,577 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:17:02,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:17:02,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 13:17:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:17:02,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:19:20,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-08 13:19:20,481 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-08 13:19:20,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-08 13:19:20,482 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-08 13:19:20,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 20);havoc #t~post5; {22623#true} is VALID [2022-04-08 13:19:20,482 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-08 13:19:20,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:20,482 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-08 13:19:20,482 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-08 13:19:20,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:20,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:20,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:20,483 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-08 13:19:20,483 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-08 13:19:20,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:19:20,483 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-08 13:19:20,483 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-08 13:19:20,484 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-08 13:19:22,486 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-08 13:19:22,487 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-08 13:19:22,487 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-08 13:19:22,487 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-08 13:19:22,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:22,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:22,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:22,488 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-08 13:19:22,488 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-08 13:19:22,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:22,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:22,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:22,488 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-08 13:19:22,488 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-08 13:19:22,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:22,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:22,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:22,489 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-08 13:19:23,761 INFO 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 VALID [2022-04-08 13:19:23,762 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-08 13:19:23,763 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-08 13:19:23,763 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-08 13:19:23,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:23,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:23,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:23,763 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-08 13:19:23,763 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-08 13:19:23,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:23,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:23,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:23,764 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-08 13:19:23,764 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-08 13:19:23,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:23,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:23,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:23,765 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-08 13:19:23,765 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-08 13:19:23,766 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-08 13:19:23,766 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-08 13:19:23,766 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-08 13:19:23,766 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:23,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:23,766 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:23,767 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-08 13:19:23,767 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-08 13:19:23,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:19:23,767 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-08 13:19:23,768 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-08 13:19:23,768 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; {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 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-08 13:19:25,771 WARN L290 TraceCheckUtils]: 72: Hoare triple {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 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 !!(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); {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} is UNKNOWN [2022-04-08 13:19:25,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-08 13:19:25,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-08 13:19:25,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} assume !!(#t~post6 < 20);havoc #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-08 13:19:25,821 INFO L272 TraceCheckUtils]: 76: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:19:25,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:25,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:25,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:25,822 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #84#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-08 13:19:25,822 INFO L272 TraceCheckUtils]: 81: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:19:25,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:19:25,823 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-08 13:19:25,823 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-08 13:19:25,824 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #86#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-08 13:19:25,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_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_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 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); {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-08 13:19:25,842 INFO L290 TraceCheckUtils]: 87: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-08 13:19:25,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-08 13:19:25,845 INFO L290 TraceCheckUtils]: 89: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume !!(#t~post6 < 20);havoc #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-08 13:19:25,845 INFO L272 TraceCheckUtils]: 90: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* 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-08 13:19:25,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:19:25,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:19:25,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:19:25,846 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #84#return; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-08 13:19:25,847 INFO L272 TraceCheckUtils]: 95: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:19:25,847 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:19:25,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-08 13:19:25,848 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-08 13:19:25,848 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-08 13:19:25,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:21:13,143 WARN L232 SmtUtils]: Spent 5.68s 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-08 13:23:07,382 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-08 13:23:07,383 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-08 13:23:07,383 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:23:07,383 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)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:23:07,384 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-08 13:23:07,384 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,384 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-08 13:23:07,385 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-08 13:23:07,385 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-08 13:23:07,385 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-08 13:23:07,399 INFO L290 TraceCheckUtils]: 86: Hoare triple {22970#(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-08 13:23:07,413 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22974#(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; {22970#(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-08 13:23:07,414 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-08 13:23:07,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {22984#(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-08 13:23:07,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:23:07,414 INFO L272 TraceCheckUtils]: 81: Hoare triple {22974#(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-08 13:23:07,415 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22974#(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; {22974#(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-08 13:23:07,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,415 INFO L272 TraceCheckUtils]: 76: Hoare triple {22974#(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-08 13:23:07,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {22974#(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; {22974#(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-08 13:23:07,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {22974#(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; {22974#(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-08 13:23:07,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {22974#(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; {22974#(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-08 13:23:07,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {23015#(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); {22974#(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-08 13:23:07,751 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23019#(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; {23015#(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-08 13:23:07,752 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-08 13:23:07,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {22984#(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-08 13:23:07,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:23:07,753 INFO L272 TraceCheckUtils]: 67: Hoare triple {23019#(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-08 13:23:07,753 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23019#(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; {23019#(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-08 13:23:07,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,754 INFO L272 TraceCheckUtils]: 62: Hoare triple {23019#(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-08 13:23:07,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {23019#(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; {23019#(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-08 13:23:07,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {23019#(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; {23019#(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-08 13:23:07,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {23056#(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); {23019#(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-08 13:23:07,759 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23056#(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; {23056#(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-08 13:23:07,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,759 INFO L272 TraceCheckUtils]: 54: Hoare triple {23056#(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-08 13:23:07,760 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23056#(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; {23056#(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-08 13:23:07,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,760 INFO L272 TraceCheckUtils]: 49: Hoare triple {23056#(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-08 13:23:07,760 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23056#(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; {23056#(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-08 13:23:07,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,761 INFO L272 TraceCheckUtils]: 44: Hoare triple {23056#(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-08 13:23:07,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {23056#(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; {23056#(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-08 13:23:07,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {23056#(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; {23056#(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-08 13:23:07,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {23111#(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; {23056#(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-08 13:23:07,804 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23111#(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; {23111#(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-08 13:23:07,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,804 INFO L272 TraceCheckUtils]: 36: Hoare triple {23111#(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-08 13:23:07,805 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23111#(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; {23111#(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-08 13:23:07,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,805 INFO L272 TraceCheckUtils]: 31: Hoare triple {23111#(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-08 13:23:07,806 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23111#(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; {23111#(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-08 13:23:07,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,806 INFO L272 TraceCheckUtils]: 26: Hoare triple {23111#(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-08 13:23:07,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {23111#(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; {23111#(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-08 13:23:07,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {23111#(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; {23111#(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-08 13:23:07,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23111#(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-08 13:23:07,811 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-08 13:23:07,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,812 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-08 13:23:07,812 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,812 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-08 13:23:07,812 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:23:07,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:23:07,812 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-08 13:23:07,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 20);havoc #t~post5; {22623#true} is VALID [2022-04-08 13:23:07,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-08 13:23:07,813 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-08 13:23:07,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-08 13:23:07,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-08 13:23:07,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:23:07,813 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-08 13:23:07,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-08 13:23:07,814 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-08 13:23:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:23:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084487346] [2022-04-08 13:23:07,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:23:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724589824] [2022-04-08 13:23:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724589824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:23:07,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:23:07,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2022-04-08 13:23:07,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:23:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412253821] [2022-04-08 13:23:07,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412253821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:23:07,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:23:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 13:23:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517535533] [2022-04-08 13:23:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:23:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-08 13:23:07,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:23:07,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:23:12,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 13:23:12,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 13:23:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:23:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 13:23:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=321, Unknown=1, NotChecked=0, Total=420 [2022-04-08 13:23:12,033 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:23:16,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:18,025 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-08 13:23:20,030 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-08 13:23:22,034 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-08 13:23:24,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:27,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:36,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:38,639 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-08 13:23:40,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:43,223 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-08 13:23:50,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:54,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:23:58,502 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-08 13:24:10,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:32,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:34,149 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-08 13:24:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:24:35,481 INFO L93 Difference]: Finished difference Result 267 states and 312 transitions. [2022-04-08 13:24:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 13:24:35,481 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-08 13:24:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:24:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:24:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 102 transitions. [2022-04-08 13:24:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:24:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 102 transitions. [2022-04-08 13:24:35,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 102 transitions. [2022-04-08 13:24:42,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 100 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 13:24:42,281 INFO L225 Difference]: With dead ends: 267 [2022-04-08 13:24:42,281 INFO L226 Difference]: Without dead ends: 265 [2022-04-08 13:24:42,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=111, Invalid=394, Unknown=1, NotChecked=0, Total=506 [2022-04-08 13:24:42,282 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2022-04-08 13:24:42,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 240 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 8 Unknown, 67 Unchecked, 36.3s Time] [2022-04-08 13:24:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-08 13:24:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2022-04-08 13:24:42,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:24:42,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 13:24:42,627 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 13:24:42,628 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 13:24:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:24:42,631 INFO L93 Difference]: Finished difference Result 265 states and 310 transitions. [2022-04-08 13:24:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-04-08 13:24:42,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:24:42,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:24:42,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 265 states. [2022-04-08 13:24:42,633 INFO L87 Difference]: Start difference. First operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 265 states. [2022-04-08 13:24:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:24:42,636 INFO L93 Difference]: Finished difference Result 265 states and 310 transitions. [2022-04-08 13:24:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-04-08 13:24:42,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:24:42,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:24:42,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:24:42,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:24:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 13:24:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2022-04-08 13:24:42,641 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 99 [2022-04-08 13:24:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:24:42,641 INFO L478 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2022-04-08 13:24:42,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) 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), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:24:42,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 300 transitions. [2022-04-08 13:24:43,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:24:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2022-04-08 13:24:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 13:24:43,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:24:43,131 INFO L499 BasicCegarLoop]: 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-08 13:24:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 13:24:43,331 WARN L460 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-08 13:24:43,331 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:24:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:24:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-08 13:24:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:24:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188705618] [2022-04-08 13:24:47,420 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:24:47,420 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:24:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-08 13:24:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:24:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365775576] [2022-04-08 13:24:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:24:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:24:47,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:24:47,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806325850] [2022-04-08 13:24:47,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:24:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:24:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:24:47,458 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:24:47,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 13:24:47,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 13:24:47,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:24:47,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 13:24:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:24:47,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:24:47,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {24821#true} call ULTIMATE.init(); {24821#true} is VALID [2022-04-08 13:24:47,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {24821#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; {24821#true} is VALID [2022-04-08 13:24:47,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24821#true} {24821#true} #92#return; {24821#true} is VALID [2022-04-08 13:24:47,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {24821#true} call #t~ret7 := main(); {24821#true} is VALID [2022-04-08 13:24:47,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {24821#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; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {24841#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,782 INFO L272 TraceCheckUtils]: 8: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #78#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,782 INFO L272 TraceCheckUtils]: 13: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,783 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #80#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,783 INFO L272 TraceCheckUtils]: 18: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,784 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #82#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {24841#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {24841#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,785 INFO L272 TraceCheckUtils]: 26: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #78#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,785 INFO L272 TraceCheckUtils]: 31: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,786 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #80#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,786 INFO L272 TraceCheckUtils]: 36: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,786 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #82#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {24841#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {24841#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,787 INFO L272 TraceCheckUtils]: 44: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,788 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #78#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,788 INFO L272 TraceCheckUtils]: 49: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,789 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #80#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,789 INFO L272 TraceCheckUtils]: 54: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,789 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #82#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {24841#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {24841#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,790 INFO L272 TraceCheckUtils]: 62: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,791 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #84#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,791 INFO L272 TraceCheckUtils]: 67: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,792 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #86#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {24841#(= 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); {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {24841#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {24841#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,793 INFO L272 TraceCheckUtils]: 76: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #84#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,793 INFO L272 TraceCheckUtils]: 81: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:24:47,793 INFO L290 TraceCheckUtils]: 83: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:24:47,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:24:47,794 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24821#true} {24841#(= main_~B~0 1)} #86#return; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {24841#(= 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); {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {24841#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {24841#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {24841#(= main_~B~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24841#(= main_~B~0 1)} is VALID [2022-04-08 13:24:47,795 INFO L272 TraceCheckUtils]: 90: Hoare triple {24841#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:24:47,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {24821#true} ~cond := #in~cond; {25100#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:24:47,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {25100#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:47,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:47,797 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} {24841#(= main_~B~0 1)} #84#return; {25111#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-08 13:24:47,797 INFO L272 TraceCheckUtils]: 95: Hoare triple {25111#(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)); {24821#true} is VALID [2022-04-08 13:24:47,797 INFO L290 TraceCheckUtils]: 96: Hoare triple {24821#true} ~cond := #in~cond; {25100#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:24:47,797 INFO L290 TraceCheckUtils]: 97: Hoare triple {25100#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:47,797 INFO L290 TraceCheckUtils]: 98: Hoare triple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:47,799 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} {25111#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25127#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-08 13:24:47,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {25127#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25131#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-08 13:24:47,800 INFO L272 TraceCheckUtils]: 101: Hoare triple {25131#(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)); {25135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:24:47,800 INFO L290 TraceCheckUtils]: 102: Hoare triple {25135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:24:47,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {25139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24822#false} is VALID [2022-04-08 13:24:47,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {24822#false} assume !false; {24822#false} is VALID [2022-04-08 13:24:47,801 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-08 13:24:47,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:25:26,584 INFO L290 TraceCheckUtils]: 104: Hoare triple {24822#false} assume !false; {24822#false} is VALID [2022-04-08 13:25:26,584 INFO L290 TraceCheckUtils]: 103: Hoare triple {25139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24822#false} is VALID [2022-04-08 13:25:26,585 INFO L290 TraceCheckUtils]: 102: Hoare triple {25135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:25:26,585 INFO L272 TraceCheckUtils]: 101: Hoare triple {25155#(= (+ (* 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)); {25135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:25:26,586 INFO L290 TraceCheckUtils]: 100: Hoare triple {25159#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {25155#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:25:26,588 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} {25163#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #86#return; {25159#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-08 13:25:26,588 INFO L290 TraceCheckUtils]: 98: Hoare triple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:25:26,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {25173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:25:26,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {24821#true} ~cond := #in~cond; {25173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:25:26,589 INFO L272 TraceCheckUtils]: 95: Hoare triple {25163#(= (+ (* 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)); {24821#true} is VALID [2022-04-08 13:25:26,589 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} {24821#true} #84#return; {25163#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:25:26,590 INFO L290 TraceCheckUtils]: 93: Hoare triple {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:25:26,590 INFO L290 TraceCheckUtils]: 92: Hoare triple {25173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25104#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:25:26,590 INFO L290 TraceCheckUtils]: 91: Hoare triple {24821#true} ~cond := #in~cond; {25173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:25:26,590 INFO L272 TraceCheckUtils]: 90: Hoare triple {24821#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {24821#true} assume !!(#t~post6 < 20);havoc #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {24821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 87: Hoare triple {24821#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {24821#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); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24821#true} {24821#true} #86#return; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L272 TraceCheckUtils]: 81: Hoare triple {24821#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24821#true} {24821#true} #84#return; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 79: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 78: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L272 TraceCheckUtils]: 76: Hoare triple {24821#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,591 INFO L290 TraceCheckUtils]: 75: Hoare triple {24821#true} assume !!(#t~post6 < 20);havoc #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 74: Hoare triple {24821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {24821#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {24821#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); {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24821#true} {24821#true} #86#return; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L272 TraceCheckUtils]: 67: Hoare triple {24821#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24821#true} {24821#true} #84#return; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L272 TraceCheckUtils]: 62: Hoare triple {24821#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {24821#true} assume !!(#t~post6 < 20);havoc #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {24821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {24821#true} assume !(~r~0 >= ~d~0); {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24821#true} {24821#true} #82#return; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L272 TraceCheckUtils]: 54: Hoare triple {24821#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24821#true} {24821#true} #80#return; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L272 TraceCheckUtils]: 49: Hoare triple {24821#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24821#true} {24821#true} #78#return; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L272 TraceCheckUtils]: 44: Hoare triple {24821#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {24821#true} assume !!(#t~post5 < 20);havoc #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {24821#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {24821#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24821#true} {24821#true} #82#return; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L272 TraceCheckUtils]: 36: Hoare triple {24821#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24821#true} {24821#true} #80#return; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,594 INFO L272 TraceCheckUtils]: 31: Hoare triple {24821#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24821#true} {24821#true} #78#return; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L272 TraceCheckUtils]: 26: Hoare triple {24821#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {24821#true} assume !!(#t~post5 < 20);havoc #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {24821#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {24821#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24821#true} {24821#true} #82#return; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L272 TraceCheckUtils]: 18: Hoare triple {24821#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24821#true} {24821#true} #80#return; {24821#true} is VALID [2022-04-08 13:25:26,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L272 TraceCheckUtils]: 13: Hoare triple {24821#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24821#true} {24821#true} #78#return; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {24821#true} assume !(0 == ~cond); {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {24821#true} ~cond := #in~cond; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L272 TraceCheckUtils]: 8: Hoare triple {24821#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {24821#true} assume !!(#t~post5 < 20);havoc #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {24821#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {24821#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; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {24821#true} call #t~ret7 := main(); {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24821#true} {24821#true} #92#return; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {24821#true} assume true; {24821#true} is VALID [2022-04-08 13:25:26,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {24821#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; {24821#true} is VALID [2022-04-08 13:25:26,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {24821#true} call ULTIMATE.init(); {24821#true} is VALID [2022-04-08 13:25:26,597 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-08 13:25:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:25:26,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365775576] [2022-04-08 13:25:26,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:25:26,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806325850] [2022-04-08 13:25:26,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806325850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:25:26,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:25:26,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-08 13:25:26,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:25:26,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188705618] [2022-04-08 13:25:26,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188705618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:25:26,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:25:26,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 13:25:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535302388] [2022-04-08 13:25:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:25:26,598 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-08 13:25:26,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:25:26,599 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-08 13:25:26,630 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-08 13:25:26,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 13:25:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 13:25:26,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:25:26,631 INFO L87 Difference]: Start difference. First operand 258 states and 300 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-08 13:25:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:27,369 INFO L93 Difference]: Finished difference Result 275 states and 316 transitions. [2022-04-08 13:25:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:25:27,369 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-08 13:25:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:27,370 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-08 13:25:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-08 13:25:27,370 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-08 13:25:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-08 13:25:27,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-08 13:25:27,419 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-08 13:25:27,423 INFO L225 Difference]: With dead ends: 275 [2022-04-08 13:25:27,423 INFO L226 Difference]: Without dead ends: 270 [2022-04-08 13:25:27,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:25:27,424 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:25:27,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:25:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-08 13:25:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-04-08 13:25:27,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:25:27,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-08 13:25:27,779 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-08 13:25:27,779 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-08 13:25:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:27,798 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2022-04-08 13:25:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-04-08 13:25:27,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:27,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:27,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 270 states. [2022-04-08 13:25:27,799 INFO L87 Difference]: Start difference. First operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 270 states. [2022-04-08 13:25:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:27,802 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2022-04-08 13:25:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-04-08 13:25:27,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:27,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:27,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:25:27,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:25:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-08 13:25:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2022-04-08 13:25:27,806 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 105 [2022-04-08 13:25:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:25:27,807 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2022-04-08 13:25:27,807 INFO L479 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-08 13:25:27,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 281 transitions. [2022-04-08 13:25:28,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2022-04-08 13:25:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 13:25:28,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:25:28,312 INFO L499 BasicCegarLoop]: 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-08 13:25:28,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 13:25:28,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-08 13:25:28,524 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:25:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:25:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 7 times [2022-04-08 13:25:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785165599] [2022-04-08 13:25:32,601 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:25:32,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:25:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 8 times [2022-04-08 13:25:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:25:32,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746790782] [2022-04-08 13:25:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:25:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:25:32,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:25:32,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187524826] [2022-04-08 13:25:32,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:25:32,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:25:32,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:25:32,628 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:25:32,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 13:25:32,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:25:32,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:25:32,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 13:25:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:25:32,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:25:33,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {27068#true} call ULTIMATE.init(); {27068#true} is VALID [2022-04-08 13:25:33,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {27068#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; {27076#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:33,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {27076#(<= ~counter~0 0)} assume true; {27076#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:33,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27076#(<= ~counter~0 0)} {27068#true} #92#return; {27076#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:33,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {27076#(<= ~counter~0 0)} call #t~ret7 := main(); {27076#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:33,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {27076#(<= ~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; {27076#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:33,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {27076#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {27092#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {27092#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {27092#(<= ~counter~0 1)} ~cond := #in~cond; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {27092#(<= ~counter~0 1)} assume !(0 == ~cond); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {27092#(<= ~counter~0 1)} assume true; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,129 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27092#(<= ~counter~0 1)} {27092#(<= ~counter~0 1)} #78#return; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,130 INFO L272 TraceCheckUtils]: 13: Hoare triple {27092#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {27092#(<= ~counter~0 1)} ~cond := #in~cond; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {27092#(<= ~counter~0 1)} assume !(0 == ~cond); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {27092#(<= ~counter~0 1)} assume true; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,131 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27092#(<= ~counter~0 1)} {27092#(<= ~counter~0 1)} #80#return; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,132 INFO L272 TraceCheckUtils]: 18: Hoare triple {27092#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {27092#(<= ~counter~0 1)} ~cond := #in~cond; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {27092#(<= ~counter~0 1)} assume !(0 == ~cond); {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {27092#(<= ~counter~0 1)} assume true; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,133 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27092#(<= ~counter~0 1)} {27092#(<= ~counter~0 1)} #82#return; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {27092#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27092#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:33,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {27092#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {27147#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,134 INFO L272 TraceCheckUtils]: 26: Hoare triple {27147#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {27147#(<= ~counter~0 2)} ~cond := #in~cond; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {27147#(<= ~counter~0 2)} assume !(0 == ~cond); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {27147#(<= ~counter~0 2)} assume true; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,135 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27147#(<= ~counter~0 2)} {27147#(<= ~counter~0 2)} #78#return; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,136 INFO L272 TraceCheckUtils]: 31: Hoare triple {27147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {27147#(<= ~counter~0 2)} ~cond := #in~cond; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {27147#(<= ~counter~0 2)} assume !(0 == ~cond); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {27147#(<= ~counter~0 2)} assume true; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,137 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27147#(<= ~counter~0 2)} {27147#(<= ~counter~0 2)} #80#return; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,138 INFO L272 TraceCheckUtils]: 36: Hoare triple {27147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {27147#(<= ~counter~0 2)} ~cond := #in~cond; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {27147#(<= ~counter~0 2)} assume !(0 == ~cond); {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {27147#(<= ~counter~0 2)} assume true; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,139 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27147#(<= ~counter~0 2)} {27147#(<= ~counter~0 2)} #82#return; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {27147#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27147#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:33,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {27147#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {27202#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,140 INFO L272 TraceCheckUtils]: 44: Hoare triple {27202#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {27202#(<= ~counter~0 3)} ~cond := #in~cond; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {27202#(<= ~counter~0 3)} assume !(0 == ~cond); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {27202#(<= ~counter~0 3)} assume true; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,141 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27202#(<= ~counter~0 3)} {27202#(<= ~counter~0 3)} #78#return; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,142 INFO L272 TraceCheckUtils]: 49: Hoare triple {27202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {27202#(<= ~counter~0 3)} ~cond := #in~cond; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {27202#(<= ~counter~0 3)} assume !(0 == ~cond); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {27202#(<= ~counter~0 3)} assume true; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,143 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27202#(<= ~counter~0 3)} {27202#(<= ~counter~0 3)} #80#return; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,143 INFO L272 TraceCheckUtils]: 54: Hoare triple {27202#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {27202#(<= ~counter~0 3)} ~cond := #in~cond; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {27202#(<= ~counter~0 3)} assume !(0 == ~cond); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {27202#(<= ~counter~0 3)} assume true; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,145 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27202#(<= ~counter~0 3)} {27202#(<= ~counter~0 3)} #82#return; {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {27202#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {27202#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:33,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {27202#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {27257#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,146 INFO L272 TraceCheckUtils]: 62: Hoare triple {27257#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {27257#(<= ~counter~0 4)} ~cond := #in~cond; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {27257#(<= ~counter~0 4)} assume !(0 == ~cond); {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {27257#(<= ~counter~0 4)} assume true; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,148 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27257#(<= ~counter~0 4)} {27257#(<= ~counter~0 4)} #84#return; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,148 INFO L272 TraceCheckUtils]: 67: Hoare triple {27257#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {27257#(<= ~counter~0 4)} ~cond := #in~cond; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {27257#(<= ~counter~0 4)} assume !(0 == ~cond); {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {27257#(<= ~counter~0 4)} assume true; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27257#(<= ~counter~0 4)} {27257#(<= ~counter~0 4)} #86#return; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {27257#(<= ~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); {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {27257#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27257#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:33,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {27257#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {27300#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,151 INFO L272 TraceCheckUtils]: 76: Hoare triple {27300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {27300#(<= ~counter~0 5)} ~cond := #in~cond; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {27300#(<= ~counter~0 5)} assume !(0 == ~cond); {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,152 INFO L290 TraceCheckUtils]: 79: Hoare triple {27300#(<= ~counter~0 5)} assume true; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,152 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27300#(<= ~counter~0 5)} {27300#(<= ~counter~0 5)} #84#return; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,153 INFO L272 TraceCheckUtils]: 81: Hoare triple {27300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {27300#(<= ~counter~0 5)} ~cond := #in~cond; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {27300#(<= ~counter~0 5)} assume !(0 == ~cond); {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,154 INFO L290 TraceCheckUtils]: 84: Hoare triple {27300#(<= ~counter~0 5)} assume true; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,154 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27300#(<= ~counter~0 5)} {27300#(<= ~counter~0 5)} #86#return; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {27300#(<= ~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); {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {27300#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27300#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:33,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {27300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {27343#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,156 INFO L272 TraceCheckUtils]: 90: Hoare triple {27343#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,156 INFO L290 TraceCheckUtils]: 91: Hoare triple {27343#(<= ~counter~0 6)} ~cond := #in~cond; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,156 INFO L290 TraceCheckUtils]: 92: Hoare triple {27343#(<= ~counter~0 6)} assume !(0 == ~cond); {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {27343#(<= ~counter~0 6)} assume true; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,157 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27343#(<= ~counter~0 6)} {27343#(<= ~counter~0 6)} #84#return; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,158 INFO L272 TraceCheckUtils]: 95: Hoare triple {27343#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {27343#(<= ~counter~0 6)} ~cond := #in~cond; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {27343#(<= ~counter~0 6)} assume !(0 == ~cond); {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,158 INFO L290 TraceCheckUtils]: 98: Hoare triple {27343#(<= ~counter~0 6)} assume true; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,159 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27343#(<= ~counter~0 6)} {27343#(<= ~counter~0 6)} #86#return; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {27343#(<= ~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); {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,159 INFO L290 TraceCheckUtils]: 101: Hoare triple {27343#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27343#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:33,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {27343#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27386#(<= |main_#t~post6| 6)} is VALID [2022-04-08 13:25:33,160 INFO L290 TraceCheckUtils]: 103: Hoare triple {27386#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {27069#false} is VALID [2022-04-08 13:25:33,160 INFO L272 TraceCheckUtils]: 104: Hoare triple {27069#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27069#false} is VALID [2022-04-08 13:25:33,160 INFO L290 TraceCheckUtils]: 105: Hoare triple {27069#false} ~cond := #in~cond; {27069#false} is VALID [2022-04-08 13:25:33,160 INFO L290 TraceCheckUtils]: 106: Hoare triple {27069#false} assume 0 == ~cond; {27069#false} is VALID [2022-04-08 13:25:33,160 INFO L290 TraceCheckUtils]: 107: Hoare triple {27069#false} assume !false; {27069#false} is VALID [2022-04-08 13:25:33,161 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-08 13:25:33,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:25:33,586 INFO L290 TraceCheckUtils]: 107: Hoare triple {27069#false} assume !false; {27069#false} is VALID [2022-04-08 13:25:33,586 INFO L290 TraceCheckUtils]: 106: Hoare triple {27069#false} assume 0 == ~cond; {27069#false} is VALID [2022-04-08 13:25:33,586 INFO L290 TraceCheckUtils]: 105: Hoare triple {27069#false} ~cond := #in~cond; {27069#false} is VALID [2022-04-08 13:25:33,586 INFO L272 TraceCheckUtils]: 104: Hoare triple {27069#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27069#false} is VALID [2022-04-08 13:25:33,587 INFO L290 TraceCheckUtils]: 103: Hoare triple {27414#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {27069#false} is VALID [2022-04-08 13:25:33,587 INFO L290 TraceCheckUtils]: 102: Hoare triple {27418#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27414#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:25:33,587 INFO L290 TraceCheckUtils]: 101: Hoare triple {27418#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {27418#(< ~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); {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,588 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27068#true} {27418#(< ~counter~0 20)} #86#return; {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,588 INFO L290 TraceCheckUtils]: 98: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,588 INFO L290 TraceCheckUtils]: 97: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,588 INFO L290 TraceCheckUtils]: 96: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,588 INFO L272 TraceCheckUtils]: 95: Hoare triple {27418#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,589 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27068#true} {27418#(< ~counter~0 20)} #84#return; {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,589 INFO L290 TraceCheckUtils]: 91: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,589 INFO L272 TraceCheckUtils]: 90: Hoare triple {27418#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,589 INFO L290 TraceCheckUtils]: 89: Hoare triple {27418#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {27461#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27418#(< ~counter~0 20)} is VALID [2022-04-08 13:25:33,591 INFO L290 TraceCheckUtils]: 87: Hoare triple {27461#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {27461#(< ~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); {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,591 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27068#true} {27461#(< ~counter~0 19)} #86#return; {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L290 TraceCheckUtils]: 82: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L272 TraceCheckUtils]: 81: Hoare triple {27461#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27068#true} {27461#(< ~counter~0 19)} #84#return; {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,592 INFO L290 TraceCheckUtils]: 79: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L290 TraceCheckUtils]: 78: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L290 TraceCheckUtils]: 77: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,592 INFO L272 TraceCheckUtils]: 76: Hoare triple {27461#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {27461#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {27504#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27461#(< ~counter~0 19)} is VALID [2022-04-08 13:25:33,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {27504#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {27504#(< ~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); {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,594 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27068#true} {27504#(< ~counter~0 18)} #86#return; {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,594 INFO L272 TraceCheckUtils]: 67: Hoare triple {27504#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,595 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27068#true} {27504#(< ~counter~0 18)} #84#return; {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,595 INFO L272 TraceCheckUtils]: 62: Hoare triple {27504#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {27504#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {27547#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27504#(< ~counter~0 18)} is VALID [2022-04-08 13:25:33,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {27547#(< ~counter~0 17)} assume !(~r~0 >= ~d~0); {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,597 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27068#true} {27547#(< ~counter~0 17)} #82#return; {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,597 INFO L272 TraceCheckUtils]: 54: Hoare triple {27547#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,597 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27068#true} {27547#(< ~counter~0 17)} #80#return; {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L272 TraceCheckUtils]: 49: Hoare triple {27547#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27068#true} {27547#(< ~counter~0 17)} #78#return; {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,598 INFO L272 TraceCheckUtils]: 44: Hoare triple {27547#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {27547#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {27602#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27547#(< ~counter~0 17)} is VALID [2022-04-08 13:25:33,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {27602#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,600 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27068#true} {27602#(< ~counter~0 16)} #82#return; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,600 INFO L272 TraceCheckUtils]: 36: Hoare triple {27602#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27068#true} {27602#(< ~counter~0 16)} #80#return; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L272 TraceCheckUtils]: 31: Hoare triple {27602#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27068#true} {27602#(< ~counter~0 16)} #78#return; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,602 INFO L272 TraceCheckUtils]: 26: Hoare triple {27602#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {27602#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {27657#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27602#(< ~counter~0 16)} is VALID [2022-04-08 13:25:33,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {27657#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,603 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27068#true} {27657#(< ~counter~0 15)} #82#return; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,603 INFO L272 TraceCheckUtils]: 18: Hoare triple {27657#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,604 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27068#true} {27657#(< ~counter~0 15)} #80#return; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,604 INFO L272 TraceCheckUtils]: 13: Hoare triple {27657#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,605 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27068#true} {27657#(< ~counter~0 15)} #78#return; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-08 13:25:33,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {27068#true} assume !(0 == ~cond); {27068#true} is VALID [2022-04-08 13:25:33,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {27068#true} ~cond := #in~cond; {27068#true} is VALID [2022-04-08 13:25:33,605 INFO L272 TraceCheckUtils]: 8: Hoare triple {27657#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27068#true} is VALID [2022-04-08 13:25:33,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {27657#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {27712#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27657#(< ~counter~0 15)} is VALID [2022-04-08 13:25:33,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {27712#(< ~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; {27712#(< ~counter~0 14)} is VALID [2022-04-08 13:25:33,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {27712#(< ~counter~0 14)} call #t~ret7 := main(); {27712#(< ~counter~0 14)} is VALID [2022-04-08 13:25:33,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27712#(< ~counter~0 14)} {27068#true} #92#return; {27712#(< ~counter~0 14)} is VALID [2022-04-08 13:25:33,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {27712#(< ~counter~0 14)} assume true; {27712#(< ~counter~0 14)} is VALID [2022-04-08 13:25:33,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {27068#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; {27712#(< ~counter~0 14)} is VALID [2022-04-08 13:25:33,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {27068#true} call ULTIMATE.init(); {27068#true} is VALID [2022-04-08 13:25:33,608 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-08 13:25:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:25:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746790782] [2022-04-08 13:25:33,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:25:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187524826] [2022-04-08 13:25:33,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187524826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:25:33,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:25:33,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 13:25:33,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:25:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785165599] [2022-04-08 13:25:33,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785165599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:25:33,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:25:33,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 13:25:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972053993] [2022-04-08 13:25:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:25:33,609 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-08 13:25:33,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:25:33,609 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-08 13:25:33,667 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-08 13:25:33,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 13:25:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 13:25:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:25:33,668 INFO L87 Difference]: Start difference. First operand 253 states and 281 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-08 13:25:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:34,288 INFO L93 Difference]: Finished difference Result 333 states and 370 transitions. [2022-04-08 13:25:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 13:25:34,288 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-08 13:25:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:34,288 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-08 13:25:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-08 13:25:34,290 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-08 13:25:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-08 13:25:34,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2022-04-08 13:25:34,426 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-08 13:25:34,431 INFO L225 Difference]: With dead ends: 333 [2022-04-08 13:25:34,431 INFO L226 Difference]: Without dead ends: 320 [2022-04-08 13:25:34,432 INFO L912 BasicCegarLoop]: 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-08 13:25:34,432 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 58 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:25:34,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 191 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:25:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-08 13:25:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2022-04-08 13:25:34,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:25:34,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:34,878 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:34,878 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:34,882 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2022-04-08 13:25:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2022-04-08 13:25:34,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:34,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:34,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 320 states. [2022-04-08 13:25:34,883 INFO L87 Difference]: Start difference. First operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 320 states. [2022-04-08 13:25:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:34,887 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2022-04-08 13:25:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2022-04-08 13:25:34,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:34,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:34,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:25:34,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:25:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 349 transitions. [2022-04-08 13:25:34,893 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 349 transitions. Word has length 108 [2022-04-08 13:25:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:25:34,893 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 349 transitions. [2022-04-08 13:25:34,893 INFO L479 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-08 13:25:34,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 319 states and 349 transitions. [2022-04-08 13:25:35,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 349 transitions. [2022-04-08 13:25:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 13:25:35,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:25:35,466 INFO L499 BasicCegarLoop]: 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-08 13:25:35,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 13:25:35,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 13:25:35,666 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:25:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:25:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 1 times [2022-04-08 13:25:35,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:35,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458624762] [2022-04-08 13:25:39,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:25:39,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:25:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 2 times [2022-04-08 13:25:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:25:39,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48748571] [2022-04-08 13:25:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:25:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:25:39,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:25:39,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828464497] [2022-04-08 13:25:39,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:25:39,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:25:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:25:39,769 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:25:39,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 13:25:39,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:25:39,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:25:39,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 13:25:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:25:39,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:25:40,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {29683#true} call ULTIMATE.init(); {29683#true} is VALID [2022-04-08 13:25:40,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {29683#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; {29691#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:40,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {29691#(<= ~counter~0 0)} assume true; {29691#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:40,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29691#(<= ~counter~0 0)} {29683#true} #92#return; {29691#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:40,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {29691#(<= ~counter~0 0)} call #t~ret7 := main(); {29691#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:40,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {29691#(<= ~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; {29691#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:40,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {29691#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {29707#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {29707#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {29707#(<= ~counter~0 1)} ~cond := #in~cond; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {29707#(<= ~counter~0 1)} assume !(0 == ~cond); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {29707#(<= ~counter~0 1)} assume true; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,310 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29707#(<= ~counter~0 1)} {29707#(<= ~counter~0 1)} #78#return; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,311 INFO L272 TraceCheckUtils]: 13: Hoare triple {29707#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {29707#(<= ~counter~0 1)} ~cond := #in~cond; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {29707#(<= ~counter~0 1)} assume !(0 == ~cond); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {29707#(<= ~counter~0 1)} assume true; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,312 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29707#(<= ~counter~0 1)} {29707#(<= ~counter~0 1)} #80#return; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {29707#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {29707#(<= ~counter~0 1)} ~cond := #in~cond; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {29707#(<= ~counter~0 1)} assume !(0 == ~cond); {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {29707#(<= ~counter~0 1)} assume true; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,314 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29707#(<= ~counter~0 1)} {29707#(<= ~counter~0 1)} #82#return; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {29707#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29707#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:40,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {29707#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {29762#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,315 INFO L272 TraceCheckUtils]: 26: Hoare triple {29762#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {29762#(<= ~counter~0 2)} ~cond := #in~cond; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {29762#(<= ~counter~0 2)} assume !(0 == ~cond); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {29762#(<= ~counter~0 2)} assume true; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,317 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29762#(<= ~counter~0 2)} {29762#(<= ~counter~0 2)} #78#return; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,317 INFO L272 TraceCheckUtils]: 31: Hoare triple {29762#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {29762#(<= ~counter~0 2)} ~cond := #in~cond; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {29762#(<= ~counter~0 2)} assume !(0 == ~cond); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {29762#(<= ~counter~0 2)} assume true; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,318 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29762#(<= ~counter~0 2)} {29762#(<= ~counter~0 2)} #80#return; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,319 INFO L272 TraceCheckUtils]: 36: Hoare triple {29762#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {29762#(<= ~counter~0 2)} ~cond := #in~cond; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {29762#(<= ~counter~0 2)} assume !(0 == ~cond); {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {29762#(<= ~counter~0 2)} assume true; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,320 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29762#(<= ~counter~0 2)} {29762#(<= ~counter~0 2)} #82#return; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {29762#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29762#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:40,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {29762#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {29817#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,322 INFO L272 TraceCheckUtils]: 44: Hoare triple {29817#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {29817#(<= ~counter~0 3)} ~cond := #in~cond; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {29817#(<= ~counter~0 3)} assume !(0 == ~cond); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {29817#(<= ~counter~0 3)} assume true; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,323 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29817#(<= ~counter~0 3)} {29817#(<= ~counter~0 3)} #78#return; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,323 INFO L272 TraceCheckUtils]: 49: Hoare triple {29817#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {29817#(<= ~counter~0 3)} ~cond := #in~cond; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {29817#(<= ~counter~0 3)} assume !(0 == ~cond); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {29817#(<= ~counter~0 3)} assume true; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,325 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29817#(<= ~counter~0 3)} {29817#(<= ~counter~0 3)} #80#return; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,325 INFO L272 TraceCheckUtils]: 54: Hoare triple {29817#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {29817#(<= ~counter~0 3)} ~cond := #in~cond; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {29817#(<= ~counter~0 3)} assume !(0 == ~cond); {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {29817#(<= ~counter~0 3)} assume true; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,327 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29817#(<= ~counter~0 3)} {29817#(<= ~counter~0 3)} #82#return; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {29817#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29817#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:40,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {29817#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {29872#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,328 INFO L272 TraceCheckUtils]: 62: Hoare triple {29872#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {29872#(<= ~counter~0 4)} ~cond := #in~cond; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {29872#(<= ~counter~0 4)} assume !(0 == ~cond); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {29872#(<= ~counter~0 4)} assume true; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,329 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29872#(<= ~counter~0 4)} {29872#(<= ~counter~0 4)} #78#return; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,330 INFO L272 TraceCheckUtils]: 67: Hoare triple {29872#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {29872#(<= ~counter~0 4)} ~cond := #in~cond; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {29872#(<= ~counter~0 4)} assume !(0 == ~cond); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {29872#(<= ~counter~0 4)} assume true; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,331 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29872#(<= ~counter~0 4)} {29872#(<= ~counter~0 4)} #80#return; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,331 INFO L272 TraceCheckUtils]: 72: Hoare triple {29872#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {29872#(<= ~counter~0 4)} ~cond := #in~cond; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {29872#(<= ~counter~0 4)} assume !(0 == ~cond); {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {29872#(<= ~counter~0 4)} assume true; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,333 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29872#(<= ~counter~0 4)} {29872#(<= ~counter~0 4)} #82#return; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {29872#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29872#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:40,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {29872#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {29927#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,334 INFO L272 TraceCheckUtils]: 80: Hoare triple {29927#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {29927#(<= ~counter~0 5)} ~cond := #in~cond; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {29927#(<= ~counter~0 5)} assume !(0 == ~cond); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {29927#(<= ~counter~0 5)} assume true; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,336 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29927#(<= ~counter~0 5)} {29927#(<= ~counter~0 5)} #78#return; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,336 INFO L272 TraceCheckUtils]: 85: Hoare triple {29927#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {29927#(<= ~counter~0 5)} ~cond := #in~cond; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {29927#(<= ~counter~0 5)} assume !(0 == ~cond); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {29927#(<= ~counter~0 5)} assume true; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,337 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29927#(<= ~counter~0 5)} {29927#(<= ~counter~0 5)} #80#return; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,338 INFO L272 TraceCheckUtils]: 90: Hoare triple {29927#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {29927#(<= ~counter~0 5)} ~cond := #in~cond; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {29927#(<= ~counter~0 5)} assume !(0 == ~cond); {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {29927#(<= ~counter~0 5)} assume true; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,339 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29927#(<= ~counter~0 5)} {29927#(<= ~counter~0 5)} #82#return; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {29927#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29927#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 96: Hoare triple {29927#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29982#(<= |main_#t~post5| 5)} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 97: Hoare triple {29982#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 98: Hoare triple {29684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 99: Hoare triple {29684#false} assume !!(#t~post6 < 20);havoc #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L272 TraceCheckUtils]: 100: Hoare triple {29684#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 101: Hoare triple {29684#false} ~cond := #in~cond; {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 102: Hoare triple {29684#false} assume !(0 == ~cond); {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L290 TraceCheckUtils]: 103: Hoare triple {29684#false} assume true; {29684#false} is VALID [2022-04-08 13:25:40,340 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29684#false} {29684#false} #84#return; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L272 TraceCheckUtils]: 105: Hoare triple {29684#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 106: Hoare triple {29684#false} ~cond := #in~cond; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 107: Hoare triple {29684#false} assume !(0 == ~cond); {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 108: Hoare triple {29684#false} assume true; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29684#false} {29684#false} #86#return; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {29684#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); {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 111: Hoare triple {29684#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 112: Hoare triple {29684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {29684#false} assume !(#t~post6 < 20);havoc #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L272 TraceCheckUtils]: 114: Hoare triple {29684#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 115: Hoare triple {29684#false} ~cond := #in~cond; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {29684#false} assume 0 == ~cond; {29684#false} is VALID [2022-04-08 13:25:40,341 INFO L290 TraceCheckUtils]: 117: Hoare triple {29684#false} assume !false; {29684#false} is VALID [2022-04-08 13:25:40,342 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-08 13:25:40,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 117: Hoare triple {29684#false} assume !false; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 116: Hoare triple {29684#false} assume 0 == ~cond; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 115: Hoare triple {29684#false} ~cond := #in~cond; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L272 TraceCheckUtils]: 114: Hoare triple {29684#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 113: Hoare triple {29684#false} assume !(#t~post6 < 20);havoc #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {29684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {29684#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {29684#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); {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29683#true} {29684#false} #86#return; {29684#false} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 108: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,661 INFO L290 TraceCheckUtils]: 107: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 106: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L272 TraceCheckUtils]: 105: Hoare triple {29684#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29683#true} {29684#false} #84#return; {29684#false} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 103: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 102: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 101: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L272 TraceCheckUtils]: 100: Hoare triple {29684#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 99: Hoare triple {29684#false} assume !!(#t~post6 < 20);havoc #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 98: Hoare triple {29684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29684#false} is VALID [2022-04-08 13:25:40,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {30106#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {29684#false} is VALID [2022-04-08 13:25:40,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {30110#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30106#(< |main_#t~post5| 20)} is VALID [2022-04-08 13:25:40,663 INFO L290 TraceCheckUtils]: 95: Hoare triple {30110#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,663 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29683#true} {30110#(< ~counter~0 20)} #82#return; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,663 INFO L272 TraceCheckUtils]: 90: Hoare triple {30110#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,664 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29683#true} {30110#(< ~counter~0 20)} #80#return; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,664 INFO L290 TraceCheckUtils]: 88: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 87: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 86: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L272 TraceCheckUtils]: 85: Hoare triple {30110#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29683#true} {30110#(< ~counter~0 20)} #78#return; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L272 TraceCheckUtils]: 80: Hoare triple {30110#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {30110#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {30165#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30110#(< ~counter~0 20)} is VALID [2022-04-08 13:25:40,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {30165#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,667 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29683#true} {30165#(< ~counter~0 19)} #82#return; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,667 INFO L272 TraceCheckUtils]: 72: Hoare triple {30165#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29683#true} {30165#(< ~counter~0 19)} #80#return; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L272 TraceCheckUtils]: 67: Hoare triple {30165#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29683#true} {30165#(< ~counter~0 19)} #78#return; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,668 INFO L272 TraceCheckUtils]: 62: Hoare triple {30165#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {30165#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {30220#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30165#(< ~counter~0 19)} is VALID [2022-04-08 13:25:40,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {30220#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,670 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29683#true} {30220#(< ~counter~0 18)} #82#return; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,670 INFO L272 TraceCheckUtils]: 54: Hoare triple {30220#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,670 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29683#true} {30220#(< ~counter~0 18)} #80#return; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L272 TraceCheckUtils]: 49: Hoare triple {30220#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29683#true} {30220#(< ~counter~0 18)} #78#return; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L272 TraceCheckUtils]: 44: Hoare triple {30220#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {30220#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {30275#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30220#(< ~counter~0 18)} is VALID [2022-04-08 13:25:40,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {30275#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,673 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29683#true} {30275#(< ~counter~0 17)} #82#return; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L272 TraceCheckUtils]: 36: Hoare triple {30275#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29683#true} {30275#(< ~counter~0 17)} #80#return; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,673 INFO L272 TraceCheckUtils]: 31: Hoare triple {30275#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,674 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29683#true} {30275#(< ~counter~0 17)} #78#return; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,674 INFO L272 TraceCheckUtils]: 26: Hoare triple {30275#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {30275#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {30330#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30275#(< ~counter~0 17)} is VALID [2022-04-08 13:25:40,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {30330#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,675 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29683#true} {30330#(< ~counter~0 16)} #82#return; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L272 TraceCheckUtils]: 18: Hoare triple {30330#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29683#true} {30330#(< ~counter~0 16)} #80#return; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L272 TraceCheckUtils]: 13: Hoare triple {30330#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,676 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29683#true} {30330#(< ~counter~0 16)} #78#return; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {29683#true} assume true; {29683#true} is VALID [2022-04-08 13:25:40,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {29683#true} assume !(0 == ~cond); {29683#true} is VALID [2022-04-08 13:25:40,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {29683#true} ~cond := #in~cond; {29683#true} is VALID [2022-04-08 13:25:40,677 INFO L272 TraceCheckUtils]: 8: Hoare triple {30330#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29683#true} is VALID [2022-04-08 13:25:40,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {30330#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {30385#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30330#(< ~counter~0 16)} is VALID [2022-04-08 13:25:40,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {30385#(< ~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; {30385#(< ~counter~0 15)} is VALID [2022-04-08 13:25:40,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {30385#(< ~counter~0 15)} call #t~ret7 := main(); {30385#(< ~counter~0 15)} is VALID [2022-04-08 13:25:40,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30385#(< ~counter~0 15)} {29683#true} #92#return; {30385#(< ~counter~0 15)} is VALID [2022-04-08 13:25:40,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {30385#(< ~counter~0 15)} assume true; {30385#(< ~counter~0 15)} is VALID [2022-04-08 13:25:40,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {29683#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; {30385#(< ~counter~0 15)} is VALID [2022-04-08 13:25:40,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {29683#true} call ULTIMATE.init(); {29683#true} is VALID [2022-04-08 13:25:40,679 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-08 13:25:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:25:40,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48748571] [2022-04-08 13:25:40,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:25:40,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828464497] [2022-04-08 13:25:40,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828464497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:25:40,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:25:40,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 13:25:40,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:25:40,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458624762] [2022-04-08 13:25:40,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458624762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:25:40,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:25:40,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:25:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290773035] [2022-04-08 13:25:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:25:40,681 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-08 13:25:40,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:25:40,681 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-08 13:25:40,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:40,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 13:25:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 13:25:40,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 13:25:40,732 INFO L87 Difference]: Start difference. First operand 319 states and 349 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-08 13:25:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:41,411 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2022-04-08 13:25:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 13:25:41,412 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-08 13:25:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:41,412 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-08 13:25:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-08 13:25:41,413 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-08 13:25:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-08 13:25:41,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-04-08 13:25:41,523 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-08 13:25:41,528 INFO L225 Difference]: With dead ends: 372 [2022-04-08 13:25:41,528 INFO L226 Difference]: Without dead ends: 317 [2022-04-08 13:25:41,529 INFO L912 BasicCegarLoop]: 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-08 13:25:41,530 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:25:41,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:25:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-08 13:25:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-04-08 13:25:41,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:25:41,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:41,827 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:41,827 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:41,832 INFO L93 Difference]: Finished difference Result 317 states and 346 transitions. [2022-04-08 13:25:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-08 13:25:41,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:41,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:41,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 317 states. [2022-04-08 13:25:41,833 INFO L87 Difference]: Start difference. First operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 317 states. [2022-04-08 13:25:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:41,837 INFO L93 Difference]: Finished difference Result 317 states and 346 transitions. [2022-04-08 13:25:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-08 13:25:41,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:41,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:41,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:25:41,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:25:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:25:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 346 transitions. [2022-04-08 13:25:41,843 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 346 transitions. Word has length 118 [2022-04-08 13:25:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:25:41,844 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 346 transitions. [2022-04-08 13:25:41,844 INFO L479 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-08 13:25:41,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 346 transitions. [2022-04-08 13:25:42,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-08 13:25:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 13:25:42,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:25:42,642 INFO L499 BasicCegarLoop]: 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-08 13:25:42,661 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-08 13:25:42,842 WARN L460 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-08 13:25:42,843 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:25:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:25:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 9 times [2022-04-08 13:25:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:42,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142693290] [2022-04-08 13:25:46,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:25:46,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:25:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 10 times [2022-04-08 13:25:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:25:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259445418] [2022-04-08 13:25:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:25:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:25:46,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:25:46,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641348747] [2022-04-08 13:25:46,936 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:25:46,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:25:46,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:25:46,937 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:25:46,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 13:25:47,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:25:47,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:25:47,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 13:25:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:25:47,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:25:47,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-08 13:25:47,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#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; {32436#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:47,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {32436#(<= ~counter~0 0)} assume true; {32436#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:47,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32436#(<= ~counter~0 0)} {32428#true} #92#return; {32436#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:47,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {32436#(<= ~counter~0 0)} call #t~ret7 := main(); {32436#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:47,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {32436#(<= ~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; {32436#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:47,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {32436#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {32452#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,572 INFO L272 TraceCheckUtils]: 8: Hoare triple {32452#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {32452#(<= ~counter~0 1)} ~cond := #in~cond; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {32452#(<= ~counter~0 1)} assume !(0 == ~cond); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {32452#(<= ~counter~0 1)} assume true; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,574 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32452#(<= ~counter~0 1)} {32452#(<= ~counter~0 1)} #78#return; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {32452#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {32452#(<= ~counter~0 1)} ~cond := #in~cond; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {32452#(<= ~counter~0 1)} assume !(0 == ~cond); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {32452#(<= ~counter~0 1)} assume true; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32452#(<= ~counter~0 1)} {32452#(<= ~counter~0 1)} #80#return; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,576 INFO L272 TraceCheckUtils]: 18: Hoare triple {32452#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {32452#(<= ~counter~0 1)} ~cond := #in~cond; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {32452#(<= ~counter~0 1)} assume !(0 == ~cond); {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {32452#(<= ~counter~0 1)} assume true; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,577 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32452#(<= ~counter~0 1)} {32452#(<= ~counter~0 1)} #82#return; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {32452#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32452#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:47,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {32452#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {32507#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,579 INFO L272 TraceCheckUtils]: 26: Hoare triple {32507#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {32507#(<= ~counter~0 2)} ~cond := #in~cond; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {32507#(<= ~counter~0 2)} assume !(0 == ~cond); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {32507#(<= ~counter~0 2)} assume true; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,580 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32507#(<= ~counter~0 2)} {32507#(<= ~counter~0 2)} #78#return; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,580 INFO L272 TraceCheckUtils]: 31: Hoare triple {32507#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {32507#(<= ~counter~0 2)} ~cond := #in~cond; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {32507#(<= ~counter~0 2)} assume !(0 == ~cond); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {32507#(<= ~counter~0 2)} assume true; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,582 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32507#(<= ~counter~0 2)} {32507#(<= ~counter~0 2)} #80#return; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,582 INFO L272 TraceCheckUtils]: 36: Hoare triple {32507#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {32507#(<= ~counter~0 2)} ~cond := #in~cond; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {32507#(<= ~counter~0 2)} assume !(0 == ~cond); {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {32507#(<= ~counter~0 2)} assume true; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,583 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32507#(<= ~counter~0 2)} {32507#(<= ~counter~0 2)} #82#return; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {32507#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32507#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:47,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {32507#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {32562#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,585 INFO L272 TraceCheckUtils]: 44: Hoare triple {32562#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {32562#(<= ~counter~0 3)} ~cond := #in~cond; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {32562#(<= ~counter~0 3)} assume !(0 == ~cond); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {32562#(<= ~counter~0 3)} assume true; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,586 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32562#(<= ~counter~0 3)} {32562#(<= ~counter~0 3)} #78#return; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,587 INFO L272 TraceCheckUtils]: 49: Hoare triple {32562#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {32562#(<= ~counter~0 3)} ~cond := #in~cond; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {32562#(<= ~counter~0 3)} assume !(0 == ~cond); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {32562#(<= ~counter~0 3)} assume true; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,588 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32562#(<= ~counter~0 3)} {32562#(<= ~counter~0 3)} #80#return; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,589 INFO L272 TraceCheckUtils]: 54: Hoare triple {32562#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {32562#(<= ~counter~0 3)} ~cond := #in~cond; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {32562#(<= ~counter~0 3)} assume !(0 == ~cond); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {32562#(<= ~counter~0 3)} assume true; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,590 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32562#(<= ~counter~0 3)} {32562#(<= ~counter~0 3)} #82#return; {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {32562#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {32562#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:47,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {32562#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {32617#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,592 INFO L272 TraceCheckUtils]: 62: Hoare triple {32617#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {32617#(<= ~counter~0 4)} ~cond := #in~cond; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {32617#(<= ~counter~0 4)} assume !(0 == ~cond); {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {32617#(<= ~counter~0 4)} assume true; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,593 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32617#(<= ~counter~0 4)} {32617#(<= ~counter~0 4)} #84#return; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,594 INFO L272 TraceCheckUtils]: 67: Hoare triple {32617#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {32617#(<= ~counter~0 4)} ~cond := #in~cond; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {32617#(<= ~counter~0 4)} assume !(0 == ~cond); {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {32617#(<= ~counter~0 4)} assume true; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,595 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32617#(<= ~counter~0 4)} {32617#(<= ~counter~0 4)} #86#return; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {32617#(<= ~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); {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {32617#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32617#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:47,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {32617#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {32660#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,597 INFO L272 TraceCheckUtils]: 76: Hoare triple {32660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {32660#(<= ~counter~0 5)} ~cond := #in~cond; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {32660#(<= ~counter~0 5)} assume !(0 == ~cond); {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {32660#(<= ~counter~0 5)} assume true; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,598 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32660#(<= ~counter~0 5)} {32660#(<= ~counter~0 5)} #84#return; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,599 INFO L272 TraceCheckUtils]: 81: Hoare triple {32660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {32660#(<= ~counter~0 5)} ~cond := #in~cond; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {32660#(<= ~counter~0 5)} assume !(0 == ~cond); {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {32660#(<= ~counter~0 5)} assume true; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,600 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32660#(<= ~counter~0 5)} {32660#(<= ~counter~0 5)} #86#return; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {32660#(<= ~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); {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {32660#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32660#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:47,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {32660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,602 INFO L290 TraceCheckUtils]: 89: Hoare triple {32703#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,602 INFO L272 TraceCheckUtils]: 90: Hoare triple {32703#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,602 INFO L290 TraceCheckUtils]: 91: Hoare triple {32703#(<= ~counter~0 6)} ~cond := #in~cond; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,603 INFO L290 TraceCheckUtils]: 92: Hoare triple {32703#(<= ~counter~0 6)} assume !(0 == ~cond); {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,603 INFO L290 TraceCheckUtils]: 93: Hoare triple {32703#(<= ~counter~0 6)} assume true; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,604 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32703#(<= ~counter~0 6)} {32703#(<= ~counter~0 6)} #84#return; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,604 INFO L272 TraceCheckUtils]: 95: Hoare triple {32703#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {32703#(<= ~counter~0 6)} ~cond := #in~cond; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,605 INFO L290 TraceCheckUtils]: 97: Hoare triple {32703#(<= ~counter~0 6)} assume !(0 == ~cond); {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,605 INFO L290 TraceCheckUtils]: 98: Hoare triple {32703#(<= ~counter~0 6)} assume true; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,605 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32703#(<= ~counter~0 6)} {32703#(<= ~counter~0 6)} #86#return; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {32703#(<= ~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); {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,606 INFO L290 TraceCheckUtils]: 101: Hoare triple {32703#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32703#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:47,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {32703#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {32746#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,607 INFO L272 TraceCheckUtils]: 104: Hoare triple {32746#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {32746#(<= ~counter~0 7)} ~cond := #in~cond; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {32746#(<= ~counter~0 7)} assume !(0 == ~cond); {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,608 INFO L290 TraceCheckUtils]: 107: Hoare triple {32746#(<= ~counter~0 7)} assume true; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,609 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32746#(<= ~counter~0 7)} {32746#(<= ~counter~0 7)} #84#return; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,609 INFO L272 TraceCheckUtils]: 109: Hoare triple {32746#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,609 INFO L290 TraceCheckUtils]: 110: Hoare triple {32746#(<= ~counter~0 7)} ~cond := #in~cond; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,610 INFO L290 TraceCheckUtils]: 111: Hoare triple {32746#(<= ~counter~0 7)} assume !(0 == ~cond); {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,610 INFO L290 TraceCheckUtils]: 112: Hoare triple {32746#(<= ~counter~0 7)} assume true; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,610 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32746#(<= ~counter~0 7)} {32746#(<= ~counter~0 7)} #86#return; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,611 INFO L290 TraceCheckUtils]: 114: Hoare triple {32746#(<= ~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); {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,611 INFO L290 TraceCheckUtils]: 115: Hoare triple {32746#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32746#(<= ~counter~0 7)} is VALID [2022-04-08 13:25:47,611 INFO L290 TraceCheckUtils]: 116: Hoare triple {32746#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32789#(<= |main_#t~post6| 7)} is VALID [2022-04-08 13:25:47,612 INFO L290 TraceCheckUtils]: 117: Hoare triple {32789#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {32429#false} is VALID [2022-04-08 13:25:47,612 INFO L272 TraceCheckUtils]: 118: Hoare triple {32429#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32429#false} is VALID [2022-04-08 13:25:47,612 INFO L290 TraceCheckUtils]: 119: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-08 13:25:47,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-08 13:25:47,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-08 13:25:47,613 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-08 13:25:47,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:25:48,128 INFO L290 TraceCheckUtils]: 121: Hoare triple {32429#false} assume !false; {32429#false} is VALID [2022-04-08 13:25:48,128 INFO L290 TraceCheckUtils]: 120: Hoare triple {32429#false} assume 0 == ~cond; {32429#false} is VALID [2022-04-08 13:25:48,128 INFO L290 TraceCheckUtils]: 119: Hoare triple {32429#false} ~cond := #in~cond; {32429#false} is VALID [2022-04-08 13:25:48,128 INFO L272 TraceCheckUtils]: 118: Hoare triple {32429#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32429#false} is VALID [2022-04-08 13:25:48,128 INFO L290 TraceCheckUtils]: 117: Hoare triple {32817#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {32429#false} is VALID [2022-04-08 13:25:48,129 INFO L290 TraceCheckUtils]: 116: Hoare triple {32821#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32817#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:25:48,129 INFO L290 TraceCheckUtils]: 115: Hoare triple {32821#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,129 INFO L290 TraceCheckUtils]: 114: Hoare triple {32821#(< ~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); {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,130 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32428#true} {32821#(< ~counter~0 20)} #86#return; {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,130 INFO L290 TraceCheckUtils]: 112: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,130 INFO L290 TraceCheckUtils]: 111: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,130 INFO L272 TraceCheckUtils]: 109: Hoare triple {32821#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,131 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32428#true} {32821#(< ~counter~0 20)} #84#return; {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,131 INFO L290 TraceCheckUtils]: 107: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,131 INFO L290 TraceCheckUtils]: 106: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,131 INFO L290 TraceCheckUtils]: 105: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,131 INFO L272 TraceCheckUtils]: 104: Hoare triple {32821#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,131 INFO L290 TraceCheckUtils]: 103: Hoare triple {32821#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,132 INFO L290 TraceCheckUtils]: 102: Hoare triple {32864#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32821#(< ~counter~0 20)} is VALID [2022-04-08 13:25:48,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {32864#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,133 INFO L290 TraceCheckUtils]: 100: Hoare triple {32864#(< ~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); {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,133 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32428#true} {32864#(< ~counter~0 19)} #86#return; {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,133 INFO L272 TraceCheckUtils]: 95: Hoare triple {32864#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,134 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32428#true} {32864#(< ~counter~0 19)} #84#return; {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,134 INFO L290 TraceCheckUtils]: 93: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,134 INFO L290 TraceCheckUtils]: 92: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,134 INFO L290 TraceCheckUtils]: 91: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,134 INFO L272 TraceCheckUtils]: 90: Hoare triple {32864#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {32864#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {32907#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32864#(< ~counter~0 19)} is VALID [2022-04-08 13:25:48,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {32907#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,136 INFO L290 TraceCheckUtils]: 86: Hoare triple {32907#(< ~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); {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,136 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32428#true} {32907#(< ~counter~0 18)} #86#return; {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,136 INFO L290 TraceCheckUtils]: 84: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,136 INFO L290 TraceCheckUtils]: 83: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,136 INFO L290 TraceCheckUtils]: 82: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,136 INFO L272 TraceCheckUtils]: 81: Hoare triple {32907#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,137 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32428#true} {32907#(< ~counter~0 18)} #84#return; {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,137 INFO L290 TraceCheckUtils]: 78: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,137 INFO L272 TraceCheckUtils]: 76: Hoare triple {32907#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {32907#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {32950#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32907#(< ~counter~0 18)} is VALID [2022-04-08 13:25:48,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {32950#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {32950#(< ~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); {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,139 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32428#true} {32950#(< ~counter~0 17)} #86#return; {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,139 INFO L272 TraceCheckUtils]: 67: Hoare triple {32950#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,140 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32428#true} {32950#(< ~counter~0 17)} #84#return; {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,140 INFO L272 TraceCheckUtils]: 62: Hoare triple {32950#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {32950#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {32993#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32950#(< ~counter~0 17)} is VALID [2022-04-08 13:25:48,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {32993#(< ~counter~0 16)} assume !(~r~0 >= ~d~0); {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,142 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32428#true} {32993#(< ~counter~0 16)} #82#return; {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,142 INFO L272 TraceCheckUtils]: 54: Hoare triple {32993#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32428#true} {32993#(< ~counter~0 16)} #80#return; {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 51: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L272 TraceCheckUtils]: 49: Hoare triple {32993#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32428#true} {32993#(< ~counter~0 16)} #78#return; {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,143 INFO L272 TraceCheckUtils]: 44: Hoare triple {32993#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {32993#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {33048#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32993#(< ~counter~0 16)} is VALID [2022-04-08 13:25:48,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {33048#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,145 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32428#true} {33048#(< ~counter~0 15)} #82#return; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,146 INFO L272 TraceCheckUtils]: 36: Hoare triple {33048#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,146 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32428#true} {33048#(< ~counter~0 15)} #80#return; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,146 INFO L272 TraceCheckUtils]: 31: Hoare triple {33048#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,147 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32428#true} {33048#(< ~counter~0 15)} #78#return; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,147 INFO L272 TraceCheckUtils]: 26: Hoare triple {33048#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {33048#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {33103#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33048#(< ~counter~0 15)} is VALID [2022-04-08 13:25:48,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {33103#(< ~counter~0 14)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,148 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32428#true} {33103#(< ~counter~0 14)} #82#return; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L272 TraceCheckUtils]: 18: Hoare triple {33103#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32428#true} {33103#(< ~counter~0 14)} #80#return; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,149 INFO L272 TraceCheckUtils]: 13: Hoare triple {33103#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,150 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32428#true} {33103#(< ~counter~0 14)} #78#return; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {32428#true} assume true; {32428#true} is VALID [2022-04-08 13:25:48,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {32428#true} assume !(0 == ~cond); {32428#true} is VALID [2022-04-08 13:25:48,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {32428#true} ~cond := #in~cond; {32428#true} is VALID [2022-04-08 13:25:48,150 INFO L272 TraceCheckUtils]: 8: Hoare triple {33103#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32428#true} is VALID [2022-04-08 13:25:48,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {33103#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {33158#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33103#(< ~counter~0 14)} is VALID [2022-04-08 13:25:48,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {33158#(< ~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; {33158#(< ~counter~0 13)} is VALID [2022-04-08 13:25:48,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {33158#(< ~counter~0 13)} call #t~ret7 := main(); {33158#(< ~counter~0 13)} is VALID [2022-04-08 13:25:48,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33158#(< ~counter~0 13)} {32428#true} #92#return; {33158#(< ~counter~0 13)} is VALID [2022-04-08 13:25:48,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {33158#(< ~counter~0 13)} assume true; {33158#(< ~counter~0 13)} is VALID [2022-04-08 13:25:48,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {32428#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; {33158#(< ~counter~0 13)} is VALID [2022-04-08 13:25:48,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {32428#true} call ULTIMATE.init(); {32428#true} is VALID [2022-04-08 13:25:48,153 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-08 13:25:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:25:48,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259445418] [2022-04-08 13:25:48,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:25:48,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641348747] [2022-04-08 13:25:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641348747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:25:48,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:25:48,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 13:25:48,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:25:48,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142693290] [2022-04-08 13:25:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142693290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:25:48,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:25:48,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 13:25:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576586060] [2022-04-08 13:25:48,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:25:48,155 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-08 13:25:48,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:25:48,155 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-08 13:25:48,230 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-08 13:25:48,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 13:25:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 13:25:48,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 13:25:48,231 INFO L87 Difference]: Start difference. First operand 317 states and 346 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-08 13:25:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:49,187 INFO L93 Difference]: Finished difference Result 413 states and 460 transitions. [2022-04-08 13:25:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 13:25:49,188 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-08 13:25:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:49,188 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-08 13:25:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-08 13:25:49,189 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-08 13:25:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-08 13:25:49,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-04-08 13:25:49,355 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-08 13:25:49,362 INFO L225 Difference]: With dead ends: 413 [2022-04-08 13:25:49,363 INFO L226 Difference]: Without dead ends: 400 [2022-04-08 13:25:49,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-04-08 13:25:49,363 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:25:49,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 247 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:25:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-08 13:25:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2022-04-08 13:25:49,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:25:49,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:49,787 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:49,787 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:49,794 INFO L93 Difference]: Finished difference Result 400 states and 440 transitions. [2022-04-08 13:25:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 440 transitions. [2022-04-08 13:25:49,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:49,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:49,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 400 states. [2022-04-08 13:25:49,796 INFO L87 Difference]: Start difference. First operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 400 states. [2022-04-08 13:25:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:49,802 INFO L93 Difference]: Finished difference Result 400 states and 440 transitions. [2022-04-08 13:25:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 440 transitions. [2022-04-08 13:25:49,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:49,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:49,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:25:49,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:25:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 439 transitions. [2022-04-08 13:25:49,811 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 439 transitions. Word has length 122 [2022-04-08 13:25:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:25:49,811 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 439 transitions. [2022-04-08 13:25:49,811 INFO L479 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-08 13:25:49,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 439 transitions. [2022-04-08 13:25:50,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 439 transitions. [2022-04-08 13:25:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-08 13:25:50,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:25:50,649 INFO L499 BasicCegarLoop]: 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-08 13:25:50,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 13:25:50,850 WARN L460 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-08 13:25:50,850 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:25:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:25:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 3 times [2022-04-08 13:25:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:50,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173803672] [2022-04-08 13:25:54,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:25:54,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:25:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 4 times [2022-04-08 13:25:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:25:54,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46523202] [2022-04-08 13:25:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:25:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:25:54,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:25:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705374749] [2022-04-08 13:25:54,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:25:54,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:25:54,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:25:54,959 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:25:54,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 13:25:55,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:25:55,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:25:55,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 13:25:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:25:55,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:25:55,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {35611#true} call ULTIMATE.init(); {35611#true} is VALID [2022-04-08 13:25:55,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {35611#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; {35619#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:55,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {35619#(<= ~counter~0 0)} assume true; {35619#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:55,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35619#(<= ~counter~0 0)} {35611#true} #92#return; {35619#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:55,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {35619#(<= ~counter~0 0)} call #t~ret7 := main(); {35619#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:55,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {35619#(<= ~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; {35619#(<= ~counter~0 0)} is VALID [2022-04-08 13:25:55,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {35619#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {35635#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,567 INFO L272 TraceCheckUtils]: 8: Hoare triple {35635#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {35635#(<= ~counter~0 1)} ~cond := #in~cond; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {35635#(<= ~counter~0 1)} assume !(0 == ~cond); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {35635#(<= ~counter~0 1)} assume true; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,569 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35635#(<= ~counter~0 1)} {35635#(<= ~counter~0 1)} #78#return; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,569 INFO L272 TraceCheckUtils]: 13: Hoare triple {35635#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {35635#(<= ~counter~0 1)} ~cond := #in~cond; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {35635#(<= ~counter~0 1)} assume !(0 == ~cond); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {35635#(<= ~counter~0 1)} assume true; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,570 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35635#(<= ~counter~0 1)} {35635#(<= ~counter~0 1)} #80#return; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,571 INFO L272 TraceCheckUtils]: 18: Hoare triple {35635#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {35635#(<= ~counter~0 1)} ~cond := #in~cond; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {35635#(<= ~counter~0 1)} assume !(0 == ~cond); {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {35635#(<= ~counter~0 1)} assume true; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,572 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35635#(<= ~counter~0 1)} {35635#(<= ~counter~0 1)} #82#return; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {35635#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35635#(<= ~counter~0 1)} is VALID [2022-04-08 13:25:55,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {35635#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {35690#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,574 INFO L272 TraceCheckUtils]: 26: Hoare triple {35690#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {35690#(<= ~counter~0 2)} ~cond := #in~cond; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {35690#(<= ~counter~0 2)} assume !(0 == ~cond); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {35690#(<= ~counter~0 2)} assume true; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,575 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35690#(<= ~counter~0 2)} {35690#(<= ~counter~0 2)} #78#return; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,575 INFO L272 TraceCheckUtils]: 31: Hoare triple {35690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {35690#(<= ~counter~0 2)} ~cond := #in~cond; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {35690#(<= ~counter~0 2)} assume !(0 == ~cond); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {35690#(<= ~counter~0 2)} assume true; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,577 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35690#(<= ~counter~0 2)} {35690#(<= ~counter~0 2)} #80#return; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,577 INFO L272 TraceCheckUtils]: 36: Hoare triple {35690#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {35690#(<= ~counter~0 2)} ~cond := #in~cond; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {35690#(<= ~counter~0 2)} assume !(0 == ~cond); {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {35690#(<= ~counter~0 2)} assume true; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,578 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35690#(<= ~counter~0 2)} {35690#(<= ~counter~0 2)} #82#return; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {35690#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35690#(<= ~counter~0 2)} is VALID [2022-04-08 13:25:55,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {35690#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {35745#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,580 INFO L272 TraceCheckUtils]: 44: Hoare triple {35745#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {35745#(<= ~counter~0 3)} ~cond := #in~cond; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {35745#(<= ~counter~0 3)} assume !(0 == ~cond); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {35745#(<= ~counter~0 3)} assume true; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,581 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35745#(<= ~counter~0 3)} {35745#(<= ~counter~0 3)} #78#return; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,582 INFO L272 TraceCheckUtils]: 49: Hoare triple {35745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {35745#(<= ~counter~0 3)} ~cond := #in~cond; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {35745#(<= ~counter~0 3)} assume !(0 == ~cond); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {35745#(<= ~counter~0 3)} assume true; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,583 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35745#(<= ~counter~0 3)} {35745#(<= ~counter~0 3)} #80#return; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,584 INFO L272 TraceCheckUtils]: 54: Hoare triple {35745#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {35745#(<= ~counter~0 3)} ~cond := #in~cond; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {35745#(<= ~counter~0 3)} assume !(0 == ~cond); {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {35745#(<= ~counter~0 3)} assume true; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,585 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35745#(<= ~counter~0 3)} {35745#(<= ~counter~0 3)} #82#return; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {35745#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35745#(<= ~counter~0 3)} is VALID [2022-04-08 13:25:55,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {35745#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {35800#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,587 INFO L272 TraceCheckUtils]: 62: Hoare triple {35800#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {35800#(<= ~counter~0 4)} ~cond := #in~cond; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {35800#(<= ~counter~0 4)} assume !(0 == ~cond); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {35800#(<= ~counter~0 4)} assume true; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,588 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35800#(<= ~counter~0 4)} {35800#(<= ~counter~0 4)} #78#return; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,588 INFO L272 TraceCheckUtils]: 67: Hoare triple {35800#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {35800#(<= ~counter~0 4)} ~cond := #in~cond; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {35800#(<= ~counter~0 4)} assume !(0 == ~cond); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {35800#(<= ~counter~0 4)} assume true; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,589 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35800#(<= ~counter~0 4)} {35800#(<= ~counter~0 4)} #80#return; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,590 INFO L272 TraceCheckUtils]: 72: Hoare triple {35800#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {35800#(<= ~counter~0 4)} ~cond := #in~cond; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {35800#(<= ~counter~0 4)} assume !(0 == ~cond); {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,591 INFO L290 TraceCheckUtils]: 75: Hoare triple {35800#(<= ~counter~0 4)} assume true; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,591 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35800#(<= ~counter~0 4)} {35800#(<= ~counter~0 4)} #82#return; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {35800#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35800#(<= ~counter~0 4)} is VALID [2022-04-08 13:25:55,592 INFO L290 TraceCheckUtils]: 78: Hoare triple {35800#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {35855#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,593 INFO L272 TraceCheckUtils]: 80: Hoare triple {35855#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {35855#(<= ~counter~0 5)} ~cond := #in~cond; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {35855#(<= ~counter~0 5)} assume !(0 == ~cond); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {35855#(<= ~counter~0 5)} assume true; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,594 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35855#(<= ~counter~0 5)} {35855#(<= ~counter~0 5)} #78#return; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,595 INFO L272 TraceCheckUtils]: 85: Hoare triple {35855#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {35855#(<= ~counter~0 5)} ~cond := #in~cond; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,595 INFO L290 TraceCheckUtils]: 87: Hoare triple {35855#(<= ~counter~0 5)} assume !(0 == ~cond); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {35855#(<= ~counter~0 5)} assume true; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,596 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35855#(<= ~counter~0 5)} {35855#(<= ~counter~0 5)} #80#return; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,596 INFO L272 TraceCheckUtils]: 90: Hoare triple {35855#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {35855#(<= ~counter~0 5)} ~cond := #in~cond; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {35855#(<= ~counter~0 5)} assume !(0 == ~cond); {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {35855#(<= ~counter~0 5)} assume true; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,598 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35855#(<= ~counter~0 5)} {35855#(<= ~counter~0 5)} #82#return; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,598 INFO L290 TraceCheckUtils]: 95: Hoare triple {35855#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35855#(<= ~counter~0 5)} is VALID [2022-04-08 13:25:55,599 INFO L290 TraceCheckUtils]: 96: Hoare triple {35855#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,599 INFO L290 TraceCheckUtils]: 97: Hoare triple {35910#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,600 INFO L272 TraceCheckUtils]: 98: Hoare triple {35910#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,600 INFO L290 TraceCheckUtils]: 99: Hoare triple {35910#(<= ~counter~0 6)} ~cond := #in~cond; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {35910#(<= ~counter~0 6)} assume !(0 == ~cond); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,600 INFO L290 TraceCheckUtils]: 101: Hoare triple {35910#(<= ~counter~0 6)} assume true; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,601 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35910#(<= ~counter~0 6)} {35910#(<= ~counter~0 6)} #78#return; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,601 INFO L272 TraceCheckUtils]: 103: Hoare triple {35910#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,601 INFO L290 TraceCheckUtils]: 104: Hoare triple {35910#(<= ~counter~0 6)} ~cond := #in~cond; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {35910#(<= ~counter~0 6)} assume !(0 == ~cond); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {35910#(<= ~counter~0 6)} assume true; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,603 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35910#(<= ~counter~0 6)} {35910#(<= ~counter~0 6)} #80#return; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,603 INFO L272 TraceCheckUtils]: 108: Hoare triple {35910#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,604 INFO L290 TraceCheckUtils]: 109: Hoare triple {35910#(<= ~counter~0 6)} ~cond := #in~cond; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,604 INFO L290 TraceCheckUtils]: 110: Hoare triple {35910#(<= ~counter~0 6)} assume !(0 == ~cond); {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,604 INFO L290 TraceCheckUtils]: 111: Hoare triple {35910#(<= ~counter~0 6)} assume true; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,605 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35910#(<= ~counter~0 6)} {35910#(<= ~counter~0 6)} #82#return; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,605 INFO L290 TraceCheckUtils]: 113: Hoare triple {35910#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35910#(<= ~counter~0 6)} is VALID [2022-04-08 13:25:55,605 INFO L290 TraceCheckUtils]: 114: Hoare triple {35910#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35965#(<= |main_#t~post5| 6)} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 115: Hoare triple {35965#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 116: Hoare triple {35612#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 117: Hoare triple {35612#false} assume !!(#t~post6 < 20);havoc #t~post6; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L272 TraceCheckUtils]: 118: Hoare triple {35612#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 119: Hoare triple {35612#false} ~cond := #in~cond; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 120: Hoare triple {35612#false} assume !(0 == ~cond); {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 121: Hoare triple {35612#false} assume true; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35612#false} {35612#false} #84#return; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L272 TraceCheckUtils]: 123: Hoare triple {35612#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 124: Hoare triple {35612#false} ~cond := #in~cond; {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 125: Hoare triple {35612#false} assume !(0 == ~cond); {35612#false} is VALID [2022-04-08 13:25:55,606 INFO L290 TraceCheckUtils]: 126: Hoare triple {35612#false} assume true; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35612#false} {35612#false} #86#return; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 128: Hoare triple {35612#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); {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 129: Hoare triple {35612#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 130: Hoare triple {35612#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 131: Hoare triple {35612#false} assume !(#t~post6 < 20);havoc #t~post6; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L272 TraceCheckUtils]: 132: Hoare triple {35612#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 133: Hoare triple {35612#false} ~cond := #in~cond; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 134: Hoare triple {35612#false} assume 0 == ~cond; {35612#false} is VALID [2022-04-08 13:25:55,607 INFO L290 TraceCheckUtils]: 135: Hoare triple {35612#false} assume !false; {35612#false} is VALID [2022-04-08 13:25:55,608 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-08 13:25:55,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:25:56,127 INFO L290 TraceCheckUtils]: 135: Hoare triple {35612#false} assume !false; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 134: Hoare triple {35612#false} assume 0 == ~cond; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 133: Hoare triple {35612#false} ~cond := #in~cond; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L272 TraceCheckUtils]: 132: Hoare triple {35612#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 131: Hoare triple {35612#false} assume !(#t~post6 < 20);havoc #t~post6; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 130: Hoare triple {35612#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 129: Hoare triple {35612#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 128: Hoare triple {35612#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); {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35611#true} {35612#false} #86#return; {35612#false} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 126: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 125: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,128 INFO L290 TraceCheckUtils]: 124: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,128 INFO L272 TraceCheckUtils]: 123: Hoare triple {35612#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,128 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35611#true} {35612#false} #84#return; {35612#false} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 121: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 120: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 119: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,129 INFO L272 TraceCheckUtils]: 118: Hoare triple {35612#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 117: Hoare triple {35612#false} assume !!(#t~post6 < 20);havoc #t~post6; {35612#false} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 116: Hoare triple {35612#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35612#false} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 115: Hoare triple {36089#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {35612#false} is VALID [2022-04-08 13:25:56,129 INFO L290 TraceCheckUtils]: 114: Hoare triple {36093#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36089#(< |main_#t~post5| 20)} is VALID [2022-04-08 13:25:56,130 INFO L290 TraceCheckUtils]: 113: Hoare triple {36093#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,130 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35611#true} {36093#(< ~counter~0 20)} #82#return; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,130 INFO L290 TraceCheckUtils]: 111: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,130 INFO L290 TraceCheckUtils]: 109: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,130 INFO L272 TraceCheckUtils]: 108: Hoare triple {36093#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,131 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35611#true} {36093#(< ~counter~0 20)} #80#return; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,131 INFO L290 TraceCheckUtils]: 106: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,131 INFO L290 TraceCheckUtils]: 105: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,131 INFO L290 TraceCheckUtils]: 104: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,131 INFO L272 TraceCheckUtils]: 103: Hoare triple {36093#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,132 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35611#true} {36093#(< ~counter~0 20)} #78#return; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,132 INFO L290 TraceCheckUtils]: 99: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,132 INFO L272 TraceCheckUtils]: 98: Hoare triple {36093#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {36093#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {36148#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36093#(< ~counter~0 20)} is VALID [2022-04-08 13:25:56,133 INFO L290 TraceCheckUtils]: 95: Hoare triple {36148#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,134 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35611#true} {36148#(< ~counter~0 19)} #82#return; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,134 INFO L290 TraceCheckUtils]: 93: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,134 INFO L290 TraceCheckUtils]: 92: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,134 INFO L290 TraceCheckUtils]: 91: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,134 INFO L272 TraceCheckUtils]: 90: Hoare triple {36148#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35611#true} {36148#(< ~counter~0 19)} #80#return; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 86: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L272 TraceCheckUtils]: 85: Hoare triple {36148#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35611#true} {36148#(< ~counter~0 19)} #78#return; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 83: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 82: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,135 INFO L290 TraceCheckUtils]: 81: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,136 INFO L272 TraceCheckUtils]: 80: Hoare triple {36148#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,136 INFO L290 TraceCheckUtils]: 79: Hoare triple {36148#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,136 INFO L290 TraceCheckUtils]: 78: Hoare triple {36203#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36148#(< ~counter~0 19)} is VALID [2022-04-08 13:25:56,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {36203#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,137 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35611#true} {36203#(< ~counter~0 18)} #82#return; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,138 INFO L272 TraceCheckUtils]: 72: Hoare triple {36203#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,138 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35611#true} {36203#(< ~counter~0 18)} #80#return; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,138 INFO L272 TraceCheckUtils]: 67: Hoare triple {36203#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,139 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35611#true} {36203#(< ~counter~0 18)} #78#return; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,139 INFO L272 TraceCheckUtils]: 62: Hoare triple {36203#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {36203#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {36258#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36203#(< ~counter~0 18)} is VALID [2022-04-08 13:25:56,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {36258#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,141 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35611#true} {36258#(< ~counter~0 17)} #82#return; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L272 TraceCheckUtils]: 54: Hoare triple {36258#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35611#true} {36258#(< ~counter~0 17)} #80#return; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L272 TraceCheckUtils]: 49: Hoare triple {36258#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35611#true} {36258#(< ~counter~0 17)} #78#return; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L272 TraceCheckUtils]: 44: Hoare triple {36258#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {36258#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {36313#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36258#(< ~counter~0 17)} is VALID [2022-04-08 13:25:56,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {36313#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,144 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35611#true} {36313#(< ~counter~0 16)} #82#return; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,144 INFO L272 TraceCheckUtils]: 36: Hoare triple {36313#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35611#true} {36313#(< ~counter~0 16)} #80#return; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L272 TraceCheckUtils]: 31: Hoare triple {36313#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35611#true} {36313#(< ~counter~0 16)} #78#return; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,146 INFO L272 TraceCheckUtils]: 26: Hoare triple {36313#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {36313#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {36368#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36313#(< ~counter~0 16)} is VALID [2022-04-08 13:25:56,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {36368#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,147 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35611#true} {36368#(< ~counter~0 15)} #82#return; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,147 INFO L272 TraceCheckUtils]: 18: Hoare triple {36368#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,148 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35611#true} {36368#(< ~counter~0 15)} #80#return; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,148 INFO L272 TraceCheckUtils]: 13: Hoare triple {36368#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,149 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35611#true} {36368#(< ~counter~0 15)} #78#return; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {35611#true} assume true; {35611#true} is VALID [2022-04-08 13:25:56,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {35611#true} assume !(0 == ~cond); {35611#true} is VALID [2022-04-08 13:25:56,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {35611#true} ~cond := #in~cond; {35611#true} is VALID [2022-04-08 13:25:56,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {36368#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35611#true} is VALID [2022-04-08 13:25:56,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {36368#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {36423#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36368#(< ~counter~0 15)} is VALID [2022-04-08 13:25:56,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {36423#(< ~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; {36423#(< ~counter~0 14)} is VALID [2022-04-08 13:25:56,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {36423#(< ~counter~0 14)} call #t~ret7 := main(); {36423#(< ~counter~0 14)} is VALID [2022-04-08 13:25:56,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36423#(< ~counter~0 14)} {35611#true} #92#return; {36423#(< ~counter~0 14)} is VALID [2022-04-08 13:25:56,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {36423#(< ~counter~0 14)} assume true; {36423#(< ~counter~0 14)} is VALID [2022-04-08 13:25:56,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {35611#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; {36423#(< ~counter~0 14)} is VALID [2022-04-08 13:25:56,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {35611#true} call ULTIMATE.init(); {35611#true} is VALID [2022-04-08 13:25:56,152 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-08 13:25:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:25:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46523202] [2022-04-08 13:25:56,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:25:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705374749] [2022-04-08 13:25:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705374749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:25:56,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:25:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 13:25:56,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:25:56,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173803672] [2022-04-08 13:25:56,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173803672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:25:56,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:25:56,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 13:25:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99015949] [2022-04-08 13:25:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:25:56,154 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-08 13:25:56,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:25:56,154 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-08 13:25:56,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:25:56,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 13:25:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 13:25:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:25:56,230 INFO L87 Difference]: Start difference. First operand 399 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-08 13:25:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:57,139 INFO L93 Difference]: Finished difference Result 452 states and 501 transitions. [2022-04-08 13:25:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 13:25:57,139 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-08 13:25:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:57,139 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-08 13:25:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-08 13:25:57,141 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-08 13:25:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-08 13:25:57,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 158 transitions. [2022-04-08 13:25:57,277 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-08 13:25:57,285 INFO L225 Difference]: With dead ends: 452 [2022-04-08 13:25:57,285 INFO L226 Difference]: Without dead ends: 397 [2022-04-08 13:25:57,285 INFO L912 BasicCegarLoop]: 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-08 13:25:57,286 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:25:57,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 206 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:25:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-08 13:25:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-04-08 13:25:57,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:25:57,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:57,896 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:57,896 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:57,902 INFO L93 Difference]: Finished difference Result 397 states and 436 transitions. [2022-04-08 13:25:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-08 13:25:57,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:57,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:57,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 397 states. [2022-04-08 13:25:57,903 INFO L87 Difference]: Start difference. First operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 397 states. [2022-04-08 13:25:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:57,909 INFO L93 Difference]: Finished difference Result 397 states and 436 transitions. [2022-04-08 13:25:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-08 13:25:57,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:25:57,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:25:57,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:25:57,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:25:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-08 13:25:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 436 transitions. [2022-04-08 13:25:57,918 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 436 transitions. Word has length 136 [2022-04-08 13:25:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:25:57,918 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 436 transitions. [2022-04-08 13:25:57,918 INFO L479 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-08 13:25:57,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 397 states and 436 transitions. [2022-04-08 13:25:58,758 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-08 13:25:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-08 13:25:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-08 13:25:58,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:25:58,759 INFO L499 BasicCegarLoop]: 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-08 13:25:58,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 13:25:58,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 13:25:58,960 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:25:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:25:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 11 times [2022-04-08 13:25:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:25:58,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094181648] [2022-04-08 13:26:03,051 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:03,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 12 times [2022-04-08 13:26:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:03,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656983251] [2022-04-08 13:26:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:03,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:03,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:03,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970746035] [2022-04-08 13:26:03,064 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:26:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:03,065 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:03,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 13:26:03,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 13:26:03,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:03,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 13:26:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:03,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:03,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {38948#true} call ULTIMATE.init(); {38948#true} is VALID [2022-04-08 13:26:03,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {38948#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; {38956#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:03,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {38956#(<= ~counter~0 0)} assume true; {38956#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:03,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38956#(<= ~counter~0 0)} {38948#true} #92#return; {38956#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:03,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {38956#(<= ~counter~0 0)} call #t~ret7 := main(); {38956#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:03,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {38956#(<= ~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; {38956#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:03,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {38956#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {38972#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {38972#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {38972#(<= ~counter~0 1)} ~cond := #in~cond; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {38972#(<= ~counter~0 1)} assume !(0 == ~cond); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {38972#(<= ~counter~0 1)} assume true; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38972#(<= ~counter~0 1)} {38972#(<= ~counter~0 1)} #78#return; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,713 INFO L272 TraceCheckUtils]: 13: Hoare triple {38972#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {38972#(<= ~counter~0 1)} ~cond := #in~cond; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {38972#(<= ~counter~0 1)} assume !(0 == ~cond); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {38972#(<= ~counter~0 1)} assume true; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,714 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38972#(<= ~counter~0 1)} {38972#(<= ~counter~0 1)} #80#return; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,716 INFO L272 TraceCheckUtils]: 18: Hoare triple {38972#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {38972#(<= ~counter~0 1)} ~cond := #in~cond; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {38972#(<= ~counter~0 1)} assume !(0 == ~cond); {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {38972#(<= ~counter~0 1)} assume true; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,717 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38972#(<= ~counter~0 1)} {38972#(<= ~counter~0 1)} #82#return; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {38972#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38972#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:03,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {38972#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {39027#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,743 INFO L272 TraceCheckUtils]: 26: Hoare triple {39027#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {39027#(<= ~counter~0 2)} ~cond := #in~cond; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {39027#(<= ~counter~0 2)} assume !(0 == ~cond); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {39027#(<= ~counter~0 2)} assume true; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,745 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {39027#(<= ~counter~0 2)} {39027#(<= ~counter~0 2)} #78#return; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,745 INFO L272 TraceCheckUtils]: 31: Hoare triple {39027#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {39027#(<= ~counter~0 2)} ~cond := #in~cond; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {39027#(<= ~counter~0 2)} assume !(0 == ~cond); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {39027#(<= ~counter~0 2)} assume true; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,746 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {39027#(<= ~counter~0 2)} {39027#(<= ~counter~0 2)} #80#return; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,747 INFO L272 TraceCheckUtils]: 36: Hoare triple {39027#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {39027#(<= ~counter~0 2)} ~cond := #in~cond; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {39027#(<= ~counter~0 2)} assume !(0 == ~cond); {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {39027#(<= ~counter~0 2)} assume true; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,748 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {39027#(<= ~counter~0 2)} {39027#(<= ~counter~0 2)} #82#return; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {39027#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39027#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:03,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {39027#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {39082#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,750 INFO L272 TraceCheckUtils]: 44: Hoare triple {39082#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {39082#(<= ~counter~0 3)} ~cond := #in~cond; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {39082#(<= ~counter~0 3)} assume !(0 == ~cond); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {39082#(<= ~counter~0 3)} assume true; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,751 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {39082#(<= ~counter~0 3)} {39082#(<= ~counter~0 3)} #78#return; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,751 INFO L272 TraceCheckUtils]: 49: Hoare triple {39082#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {39082#(<= ~counter~0 3)} ~cond := #in~cond; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {39082#(<= ~counter~0 3)} assume !(0 == ~cond); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {39082#(<= ~counter~0 3)} assume true; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,752 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {39082#(<= ~counter~0 3)} {39082#(<= ~counter~0 3)} #80#return; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,753 INFO L272 TraceCheckUtils]: 54: Hoare triple {39082#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {39082#(<= ~counter~0 3)} ~cond := #in~cond; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {39082#(<= ~counter~0 3)} assume !(0 == ~cond); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {39082#(<= ~counter~0 3)} assume true; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,754 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {39082#(<= ~counter~0 3)} {39082#(<= ~counter~0 3)} #82#return; {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,754 INFO L290 TraceCheckUtils]: 59: Hoare triple {39082#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {39082#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:03,755 INFO L290 TraceCheckUtils]: 60: Hoare triple {39082#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {39137#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,756 INFO L272 TraceCheckUtils]: 62: Hoare triple {39137#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {39137#(<= ~counter~0 4)} ~cond := #in~cond; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,756 INFO L290 TraceCheckUtils]: 64: Hoare triple {39137#(<= ~counter~0 4)} assume !(0 == ~cond); {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,756 INFO L290 TraceCheckUtils]: 65: Hoare triple {39137#(<= ~counter~0 4)} assume true; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,757 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {39137#(<= ~counter~0 4)} {39137#(<= ~counter~0 4)} #84#return; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,757 INFO L272 TraceCheckUtils]: 67: Hoare triple {39137#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {39137#(<= ~counter~0 4)} ~cond := #in~cond; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {39137#(<= ~counter~0 4)} assume !(0 == ~cond); {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {39137#(<= ~counter~0 4)} assume true; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,758 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39137#(<= ~counter~0 4)} {39137#(<= ~counter~0 4)} #86#return; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {39137#(<= ~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); {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {39137#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39137#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:03,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {39137#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {39180#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,760 INFO L272 TraceCheckUtils]: 76: Hoare triple {39180#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {39180#(<= ~counter~0 5)} ~cond := #in~cond; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {39180#(<= ~counter~0 5)} assume !(0 == ~cond); {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {39180#(<= ~counter~0 5)} assume true; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,762 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {39180#(<= ~counter~0 5)} {39180#(<= ~counter~0 5)} #84#return; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,762 INFO L272 TraceCheckUtils]: 81: Hoare triple {39180#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,762 INFO L290 TraceCheckUtils]: 82: Hoare triple {39180#(<= ~counter~0 5)} ~cond := #in~cond; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,762 INFO L290 TraceCheckUtils]: 83: Hoare triple {39180#(<= ~counter~0 5)} assume !(0 == ~cond); {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {39180#(<= ~counter~0 5)} assume true; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,763 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {39180#(<= ~counter~0 5)} {39180#(<= ~counter~0 5)} #86#return; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {39180#(<= ~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); {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,764 INFO L290 TraceCheckUtils]: 87: Hoare triple {39180#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39180#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:03,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {39180#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,765 INFO L290 TraceCheckUtils]: 89: Hoare triple {39223#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,765 INFO L272 TraceCheckUtils]: 90: Hoare triple {39223#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,765 INFO L290 TraceCheckUtils]: 91: Hoare triple {39223#(<= ~counter~0 6)} ~cond := #in~cond; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,765 INFO L290 TraceCheckUtils]: 92: Hoare triple {39223#(<= ~counter~0 6)} assume !(0 == ~cond); {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,766 INFO L290 TraceCheckUtils]: 93: Hoare triple {39223#(<= ~counter~0 6)} assume true; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,766 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {39223#(<= ~counter~0 6)} {39223#(<= ~counter~0 6)} #84#return; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,767 INFO L272 TraceCheckUtils]: 95: Hoare triple {39223#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {39223#(<= ~counter~0 6)} ~cond := #in~cond; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {39223#(<= ~counter~0 6)} assume !(0 == ~cond); {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,767 INFO L290 TraceCheckUtils]: 98: Hoare triple {39223#(<= ~counter~0 6)} assume true; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,768 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {39223#(<= ~counter~0 6)} {39223#(<= ~counter~0 6)} #86#return; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,768 INFO L290 TraceCheckUtils]: 100: Hoare triple {39223#(<= ~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); {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,768 INFO L290 TraceCheckUtils]: 101: Hoare triple {39223#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39223#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:03,769 INFO L290 TraceCheckUtils]: 102: Hoare triple {39223#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,769 INFO L290 TraceCheckUtils]: 103: Hoare triple {39266#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,770 INFO L272 TraceCheckUtils]: 104: Hoare triple {39266#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,770 INFO L290 TraceCheckUtils]: 105: Hoare triple {39266#(<= ~counter~0 7)} ~cond := #in~cond; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,770 INFO L290 TraceCheckUtils]: 106: Hoare triple {39266#(<= ~counter~0 7)} assume !(0 == ~cond); {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,770 INFO L290 TraceCheckUtils]: 107: Hoare triple {39266#(<= ~counter~0 7)} assume true; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,771 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {39266#(<= ~counter~0 7)} {39266#(<= ~counter~0 7)} #84#return; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,771 INFO L272 TraceCheckUtils]: 109: Hoare triple {39266#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {39266#(<= ~counter~0 7)} ~cond := #in~cond; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {39266#(<= ~counter~0 7)} assume !(0 == ~cond); {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,772 INFO L290 TraceCheckUtils]: 112: Hoare triple {39266#(<= ~counter~0 7)} assume true; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,772 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {39266#(<= ~counter~0 7)} {39266#(<= ~counter~0 7)} #86#return; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {39266#(<= ~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); {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,773 INFO L290 TraceCheckUtils]: 115: Hoare triple {39266#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39266#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:03,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {39266#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {39309#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,774 INFO L272 TraceCheckUtils]: 118: Hoare triple {39309#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,775 INFO L290 TraceCheckUtils]: 119: Hoare triple {39309#(<= ~counter~0 8)} ~cond := #in~cond; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,775 INFO L290 TraceCheckUtils]: 120: Hoare triple {39309#(<= ~counter~0 8)} assume !(0 == ~cond); {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,775 INFO L290 TraceCheckUtils]: 121: Hoare triple {39309#(<= ~counter~0 8)} assume true; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,776 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {39309#(<= ~counter~0 8)} {39309#(<= ~counter~0 8)} #84#return; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,776 INFO L272 TraceCheckUtils]: 123: Hoare triple {39309#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,776 INFO L290 TraceCheckUtils]: 124: Hoare triple {39309#(<= ~counter~0 8)} ~cond := #in~cond; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,777 INFO L290 TraceCheckUtils]: 125: Hoare triple {39309#(<= ~counter~0 8)} assume !(0 == ~cond); {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,777 INFO L290 TraceCheckUtils]: 126: Hoare triple {39309#(<= ~counter~0 8)} assume true; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,777 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {39309#(<= ~counter~0 8)} {39309#(<= ~counter~0 8)} #86#return; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,777 INFO L290 TraceCheckUtils]: 128: Hoare triple {39309#(<= ~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); {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,778 INFO L290 TraceCheckUtils]: 129: Hoare triple {39309#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39309#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:03,778 INFO L290 TraceCheckUtils]: 130: Hoare triple {39309#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39352#(<= |main_#t~post6| 8)} is VALID [2022-04-08 13:26:03,778 INFO L290 TraceCheckUtils]: 131: Hoare triple {39352#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {38949#false} is VALID [2022-04-08 13:26:03,778 INFO L272 TraceCheckUtils]: 132: Hoare triple {38949#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38949#false} is VALID [2022-04-08 13:26:03,779 INFO L290 TraceCheckUtils]: 133: Hoare triple {38949#false} ~cond := #in~cond; {38949#false} is VALID [2022-04-08 13:26:03,779 INFO L290 TraceCheckUtils]: 134: Hoare triple {38949#false} assume 0 == ~cond; {38949#false} is VALID [2022-04-08 13:26:03,779 INFO L290 TraceCheckUtils]: 135: Hoare triple {38949#false} assume !false; {38949#false} is VALID [2022-04-08 13:26:03,779 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-08 13:26:03,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:26:04,386 INFO L290 TraceCheckUtils]: 135: Hoare triple {38949#false} assume !false; {38949#false} is VALID [2022-04-08 13:26:04,386 INFO L290 TraceCheckUtils]: 134: Hoare triple {38949#false} assume 0 == ~cond; {38949#false} is VALID [2022-04-08 13:26:04,386 INFO L290 TraceCheckUtils]: 133: Hoare triple {38949#false} ~cond := #in~cond; {38949#false} is VALID [2022-04-08 13:26:04,386 INFO L272 TraceCheckUtils]: 132: Hoare triple {38949#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38949#false} is VALID [2022-04-08 13:26:04,387 INFO L290 TraceCheckUtils]: 131: Hoare triple {39380#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {38949#false} is VALID [2022-04-08 13:26:04,387 INFO L290 TraceCheckUtils]: 130: Hoare triple {39384#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39380#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:26:04,387 INFO L290 TraceCheckUtils]: 129: Hoare triple {39384#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,387 INFO L290 TraceCheckUtils]: 128: Hoare triple {39384#(< ~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); {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,387 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38948#true} {39384#(< ~counter~0 20)} #86#return; {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 126: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 125: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 124: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L272 TraceCheckUtils]: 123: Hoare triple {39384#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38948#true} {39384#(< ~counter~0 20)} #84#return; {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 121: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 120: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 119: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L272 TraceCheckUtils]: 118: Hoare triple {39384#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,388 INFO L290 TraceCheckUtils]: 117: Hoare triple {39384#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {39427#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39384#(< ~counter~0 20)} is VALID [2022-04-08 13:26:04,390 INFO L290 TraceCheckUtils]: 115: Hoare triple {39427#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,390 INFO L290 TraceCheckUtils]: 114: Hoare triple {39427#(< ~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); {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,390 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38948#true} {39427#(< ~counter~0 19)} #86#return; {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,390 INFO L290 TraceCheckUtils]: 112: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,390 INFO L290 TraceCheckUtils]: 111: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,390 INFO L272 TraceCheckUtils]: 109: Hoare triple {39427#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,391 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38948#true} {39427#(< ~counter~0 19)} #84#return; {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,391 INFO L272 TraceCheckUtils]: 104: Hoare triple {39427#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,391 INFO L290 TraceCheckUtils]: 103: Hoare triple {39427#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 102: Hoare triple {39470#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39427#(< ~counter~0 19)} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 101: Hoare triple {39470#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {39470#(< ~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); {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,392 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38948#true} {39470#(< ~counter~0 18)} #86#return; {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 97: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,392 INFO L290 TraceCheckUtils]: 96: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,392 INFO L272 TraceCheckUtils]: 95: Hoare triple {39470#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,393 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38948#true} {39470#(< ~counter~0 18)} #84#return; {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,393 INFO L272 TraceCheckUtils]: 90: Hoare triple {39470#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {39470#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {39513#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39470#(< ~counter~0 18)} is VALID [2022-04-08 13:26:04,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {39513#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,394 INFO L290 TraceCheckUtils]: 86: Hoare triple {39513#(< ~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); {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,394 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38948#true} {39513#(< ~counter~0 17)} #86#return; {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L290 TraceCheckUtils]: 82: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L272 TraceCheckUtils]: 81: Hoare triple {39513#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38948#true} {39513#(< ~counter~0 17)} #84#return; {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L272 TraceCheckUtils]: 76: Hoare triple {39513#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {39513#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,396 INFO L290 TraceCheckUtils]: 74: Hoare triple {39556#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39513#(< ~counter~0 17)} is VALID [2022-04-08 13:26:04,396 INFO L290 TraceCheckUtils]: 73: Hoare triple {39556#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,396 INFO L290 TraceCheckUtils]: 72: Hoare triple {39556#(< ~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); {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,396 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38948#true} {39556#(< ~counter~0 16)} #86#return; {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L272 TraceCheckUtils]: 67: Hoare triple {39556#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38948#true} {39556#(< ~counter~0 16)} #84#return; {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,397 INFO L272 TraceCheckUtils]: 62: Hoare triple {39556#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {39556#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {39599#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39556#(< ~counter~0 16)} is VALID [2022-04-08 13:26:04,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {39599#(< ~counter~0 15)} assume !(~r~0 >= ~d~0); {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,398 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38948#true} {39599#(< ~counter~0 15)} #82#return; {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L272 TraceCheckUtils]: 54: Hoare triple {39599#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38948#true} {39599#(< ~counter~0 15)} #80#return; {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,399 INFO L272 TraceCheckUtils]: 49: Hoare triple {39599#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,400 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38948#true} {39599#(< ~counter~0 15)} #78#return; {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,400 INFO L272 TraceCheckUtils]: 44: Hoare triple {39599#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {39599#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {39654#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39599#(< ~counter~0 15)} is VALID [2022-04-08 13:26:04,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {39654#(< ~counter~0 14)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,401 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38948#true} {39654#(< ~counter~0 14)} #82#return; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,401 INFO L272 TraceCheckUtils]: 36: Hoare triple {39654#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,401 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38948#true} {39654#(< ~counter~0 14)} #80#return; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L272 TraceCheckUtils]: 31: Hoare triple {39654#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38948#true} {39654#(< ~counter~0 14)} #78#return; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {39654#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {39654#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {39709#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39654#(< ~counter~0 14)} is VALID [2022-04-08 13:26:04,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {39709#(< ~counter~0 13)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,403 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38948#true} {39709#(< ~counter~0 13)} #82#return; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L272 TraceCheckUtils]: 18: Hoare triple {39709#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38948#true} {39709#(< ~counter~0 13)} #80#return; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L272 TraceCheckUtils]: 13: Hoare triple {39709#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,404 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38948#true} {39709#(< ~counter~0 13)} #78#return; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {38948#true} assume true; {38948#true} is VALID [2022-04-08 13:26:04,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {38948#true} assume !(0 == ~cond); {38948#true} is VALID [2022-04-08 13:26:04,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {38948#true} ~cond := #in~cond; {38948#true} is VALID [2022-04-08 13:26:04,405 INFO L272 TraceCheckUtils]: 8: Hoare triple {39709#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38948#true} is VALID [2022-04-08 13:26:04,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {39709#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {39764#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39709#(< ~counter~0 13)} is VALID [2022-04-08 13:26:04,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {39764#(< ~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; {39764#(< ~counter~0 12)} is VALID [2022-04-08 13:26:04,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {39764#(< ~counter~0 12)} call #t~ret7 := main(); {39764#(< ~counter~0 12)} is VALID [2022-04-08 13:26:04,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39764#(< ~counter~0 12)} {38948#true} #92#return; {39764#(< ~counter~0 12)} is VALID [2022-04-08 13:26:04,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {39764#(< ~counter~0 12)} assume true; {39764#(< ~counter~0 12)} is VALID [2022-04-08 13:26:04,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {38948#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; {39764#(< ~counter~0 12)} is VALID [2022-04-08 13:26:04,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {38948#true} call ULTIMATE.init(); {38948#true} is VALID [2022-04-08 13:26:04,407 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-08 13:26:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656983251] [2022-04-08 13:26:04,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970746035] [2022-04-08 13:26:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970746035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:26:04,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:26:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 13:26:04,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094181648] [2022-04-08 13:26:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094181648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:04,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 13:26:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124632559] [2022-04-08 13:26:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:04,408 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-08 13:26:04,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:04,409 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-08 13:26:04,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:04,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 13:26:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 13:26:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 13:26:04,460 INFO L87 Difference]: Start difference. First operand 397 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-08 13:26:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:05,392 INFO L93 Difference]: Finished difference Result 493 states and 550 transitions. [2022-04-08 13:26:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 13:26:05,392 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-08 13:26:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:05,393 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-08 13:26:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-08 13:26:05,394 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-08 13:26:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-08 13:26:05,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 193 transitions. [2022-04-08 13:26:05,487 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-08 13:26:05,498 INFO L225 Difference]: With dead ends: 493 [2022-04-08 13:26:05,498 INFO L226 Difference]: Without dead ends: 480 [2022-04-08 13:26:05,498 INFO L912 BasicCegarLoop]: 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-08 13:26:05,499 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 76 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:05,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 245 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:26:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-04-08 13:26:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2022-04-08 13:26:06,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:06,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-08 13:26:06,229 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-08 13:26:06,241 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-08 13:26:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:06,248 INFO L93 Difference]: Finished difference Result 480 states and 530 transitions. [2022-04-08 13:26:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 530 transitions. [2022-04-08 13:26:06,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:06,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:06,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 480 states. [2022-04-08 13:26:06,263 INFO L87 Difference]: Start difference. First operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 480 states. [2022-04-08 13:26:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:06,271 INFO L93 Difference]: Finished difference Result 480 states and 530 transitions. [2022-04-08 13:26:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 530 transitions. [2022-04-08 13:26:06,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:06,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:06,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:06,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-08 13:26:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 529 transitions. [2022-04-08 13:26:06,291 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 529 transitions. Word has length 136 [2022-04-08 13:26:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:06,303 INFO L478 AbstractCegarLoop]: Abstraction has 479 states and 529 transitions. [2022-04-08 13:26:06,303 INFO L479 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-08 13:26:06,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 479 states and 529 transitions. [2022-04-08 13:26:07,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 529 transitions. [2022-04-08 13:26:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-08 13:26:07,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:07,340 INFO L499 BasicCegarLoop]: 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-08 13:26:07,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:07,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 13:26:07,540 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 13 times [2022-04-08 13:26:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992825070] [2022-04-08 13:26:10,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:10,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 14 times [2022-04-08 13:26:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:10,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389249922] [2022-04-08 13:26:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:10,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712234579] [2022-04-08 13:26:10,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:26:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:10,174 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 13:26:10,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:26:10,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:10,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 13:26:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:10,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:10,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {42699#true} call ULTIMATE.init(); {42699#true} is VALID [2022-04-08 13:26:10,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {42699#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; {42707#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:10,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {42707#(<= ~counter~0 0)} assume true; {42707#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:10,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42707#(<= ~counter~0 0)} {42699#true} #92#return; {42707#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:10,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {42707#(<= ~counter~0 0)} call #t~ret7 := main(); {42707#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:10,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {42707#(<= ~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; {42707#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:10,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {42707#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {42723#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,905 INFO L272 TraceCheckUtils]: 8: Hoare triple {42723#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {42723#(<= ~counter~0 1)} ~cond := #in~cond; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {42723#(<= ~counter~0 1)} assume !(0 == ~cond); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {42723#(<= ~counter~0 1)} assume true; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,906 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42723#(<= ~counter~0 1)} {42723#(<= ~counter~0 1)} #78#return; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,906 INFO L272 TraceCheckUtils]: 13: Hoare triple {42723#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {42723#(<= ~counter~0 1)} ~cond := #in~cond; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {42723#(<= ~counter~0 1)} assume !(0 == ~cond); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {42723#(<= ~counter~0 1)} assume true; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,907 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42723#(<= ~counter~0 1)} {42723#(<= ~counter~0 1)} #80#return; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,908 INFO L272 TraceCheckUtils]: 18: Hoare triple {42723#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {42723#(<= ~counter~0 1)} ~cond := #in~cond; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {42723#(<= ~counter~0 1)} assume !(0 == ~cond); {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {42723#(<= ~counter~0 1)} assume true; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,909 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42723#(<= ~counter~0 1)} {42723#(<= ~counter~0 1)} #82#return; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {42723#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42723#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:10,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {42723#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {42778#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,911 INFO L272 TraceCheckUtils]: 26: Hoare triple {42778#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {42778#(<= ~counter~0 2)} ~cond := #in~cond; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {42778#(<= ~counter~0 2)} assume !(0 == ~cond); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {42778#(<= ~counter~0 2)} assume true; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,912 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42778#(<= ~counter~0 2)} {42778#(<= ~counter~0 2)} #78#return; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,913 INFO L272 TraceCheckUtils]: 31: Hoare triple {42778#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {42778#(<= ~counter~0 2)} ~cond := #in~cond; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {42778#(<= ~counter~0 2)} assume !(0 == ~cond); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {42778#(<= ~counter~0 2)} assume true; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,914 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42778#(<= ~counter~0 2)} {42778#(<= ~counter~0 2)} #80#return; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,914 INFO L272 TraceCheckUtils]: 36: Hoare triple {42778#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {42778#(<= ~counter~0 2)} ~cond := #in~cond; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {42778#(<= ~counter~0 2)} assume !(0 == ~cond); {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {42778#(<= ~counter~0 2)} assume true; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,916 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42778#(<= ~counter~0 2)} {42778#(<= ~counter~0 2)} #82#return; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {42778#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42778#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:10,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {42778#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {42833#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,918 INFO L272 TraceCheckUtils]: 44: Hoare triple {42833#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {42833#(<= ~counter~0 3)} ~cond := #in~cond; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {42833#(<= ~counter~0 3)} assume !(0 == ~cond); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {42833#(<= ~counter~0 3)} assume true; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,919 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42833#(<= ~counter~0 3)} {42833#(<= ~counter~0 3)} #78#return; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,919 INFO L272 TraceCheckUtils]: 49: Hoare triple {42833#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {42833#(<= ~counter~0 3)} ~cond := #in~cond; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {42833#(<= ~counter~0 3)} assume !(0 == ~cond); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {42833#(<= ~counter~0 3)} assume true; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,920 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42833#(<= ~counter~0 3)} {42833#(<= ~counter~0 3)} #80#return; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,921 INFO L272 TraceCheckUtils]: 54: Hoare triple {42833#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {42833#(<= ~counter~0 3)} ~cond := #in~cond; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {42833#(<= ~counter~0 3)} assume !(0 == ~cond); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {42833#(<= ~counter~0 3)} assume true; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,922 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42833#(<= ~counter~0 3)} {42833#(<= ~counter~0 3)} #82#return; {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {42833#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {42833#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:10,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {42833#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {42888#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,924 INFO L272 TraceCheckUtils]: 62: Hoare triple {42888#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {42888#(<= ~counter~0 4)} ~cond := #in~cond; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {42888#(<= ~counter~0 4)} assume !(0 == ~cond); {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {42888#(<= ~counter~0 4)} assume true; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,925 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42888#(<= ~counter~0 4)} {42888#(<= ~counter~0 4)} #84#return; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,926 INFO L272 TraceCheckUtils]: 67: Hoare triple {42888#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {42888#(<= ~counter~0 4)} ~cond := #in~cond; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {42888#(<= ~counter~0 4)} assume !(0 == ~cond); {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {42888#(<= ~counter~0 4)} assume true; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,927 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42888#(<= ~counter~0 4)} {42888#(<= ~counter~0 4)} #86#return; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {42888#(<= ~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); {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {42888#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42888#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:10,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {42888#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {42931#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,929 INFO L272 TraceCheckUtils]: 76: Hoare triple {42931#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {42931#(<= ~counter~0 5)} ~cond := #in~cond; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {42931#(<= ~counter~0 5)} assume !(0 == ~cond); {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {42931#(<= ~counter~0 5)} assume true; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,930 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42931#(<= ~counter~0 5)} {42931#(<= ~counter~0 5)} #84#return; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,931 INFO L272 TraceCheckUtils]: 81: Hoare triple {42931#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {42931#(<= ~counter~0 5)} ~cond := #in~cond; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {42931#(<= ~counter~0 5)} assume !(0 == ~cond); {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,932 INFO L290 TraceCheckUtils]: 84: Hoare triple {42931#(<= ~counter~0 5)} assume true; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,932 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42931#(<= ~counter~0 5)} {42931#(<= ~counter~0 5)} #86#return; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,932 INFO L290 TraceCheckUtils]: 86: Hoare triple {42931#(<= ~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); {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,933 INFO L290 TraceCheckUtils]: 87: Hoare triple {42931#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42931#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:10,934 INFO L290 TraceCheckUtils]: 88: Hoare triple {42931#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,934 INFO L290 TraceCheckUtils]: 89: Hoare triple {42974#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,934 INFO L272 TraceCheckUtils]: 90: Hoare triple {42974#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {42974#(<= ~counter~0 6)} ~cond := #in~cond; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {42974#(<= ~counter~0 6)} assume !(0 == ~cond); {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {42974#(<= ~counter~0 6)} assume true; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,936 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42974#(<= ~counter~0 6)} {42974#(<= ~counter~0 6)} #84#return; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,936 INFO L272 TraceCheckUtils]: 95: Hoare triple {42974#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {42974#(<= ~counter~0 6)} ~cond := #in~cond; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,937 INFO L290 TraceCheckUtils]: 97: Hoare triple {42974#(<= ~counter~0 6)} assume !(0 == ~cond); {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,937 INFO L290 TraceCheckUtils]: 98: Hoare triple {42974#(<= ~counter~0 6)} assume true; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,937 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42974#(<= ~counter~0 6)} {42974#(<= ~counter~0 6)} #86#return; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,937 INFO L290 TraceCheckUtils]: 100: Hoare triple {42974#(<= ~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); {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,938 INFO L290 TraceCheckUtils]: 101: Hoare triple {42974#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42974#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:10,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {42974#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,939 INFO L290 TraceCheckUtils]: 103: Hoare triple {43017#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,940 INFO L272 TraceCheckUtils]: 104: Hoare triple {43017#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,940 INFO L290 TraceCheckUtils]: 105: Hoare triple {43017#(<= ~counter~0 7)} ~cond := #in~cond; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,940 INFO L290 TraceCheckUtils]: 106: Hoare triple {43017#(<= ~counter~0 7)} assume !(0 == ~cond); {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,940 INFO L290 TraceCheckUtils]: 107: Hoare triple {43017#(<= ~counter~0 7)} assume true; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,941 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {43017#(<= ~counter~0 7)} {43017#(<= ~counter~0 7)} #84#return; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,941 INFO L272 TraceCheckUtils]: 109: Hoare triple {43017#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {43017#(<= ~counter~0 7)} ~cond := #in~cond; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,942 INFO L290 TraceCheckUtils]: 111: Hoare triple {43017#(<= ~counter~0 7)} assume !(0 == ~cond); {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,942 INFO L290 TraceCheckUtils]: 112: Hoare triple {43017#(<= ~counter~0 7)} assume true; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,942 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {43017#(<= ~counter~0 7)} {43017#(<= ~counter~0 7)} #86#return; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,943 INFO L290 TraceCheckUtils]: 114: Hoare triple {43017#(<= ~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); {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,943 INFO L290 TraceCheckUtils]: 115: Hoare triple {43017#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43017#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:10,944 INFO L290 TraceCheckUtils]: 116: Hoare triple {43017#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,944 INFO L290 TraceCheckUtils]: 117: Hoare triple {43060#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,945 INFO L272 TraceCheckUtils]: 118: Hoare triple {43060#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,945 INFO L290 TraceCheckUtils]: 119: Hoare triple {43060#(<= ~counter~0 8)} ~cond := #in~cond; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,945 INFO L290 TraceCheckUtils]: 120: Hoare triple {43060#(<= ~counter~0 8)} assume !(0 == ~cond); {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,945 INFO L290 TraceCheckUtils]: 121: Hoare triple {43060#(<= ~counter~0 8)} assume true; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,946 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {43060#(<= ~counter~0 8)} {43060#(<= ~counter~0 8)} #84#return; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,946 INFO L272 TraceCheckUtils]: 123: Hoare triple {43060#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,947 INFO L290 TraceCheckUtils]: 124: Hoare triple {43060#(<= ~counter~0 8)} ~cond := #in~cond; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,947 INFO L290 TraceCheckUtils]: 125: Hoare triple {43060#(<= ~counter~0 8)} assume !(0 == ~cond); {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,947 INFO L290 TraceCheckUtils]: 126: Hoare triple {43060#(<= ~counter~0 8)} assume true; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,948 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {43060#(<= ~counter~0 8)} {43060#(<= ~counter~0 8)} #86#return; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,948 INFO L290 TraceCheckUtils]: 128: Hoare triple {43060#(<= ~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); {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,948 INFO L290 TraceCheckUtils]: 129: Hoare triple {43060#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43060#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:10,949 INFO L290 TraceCheckUtils]: 130: Hoare triple {43060#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,949 INFO L290 TraceCheckUtils]: 131: Hoare triple {43103#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,950 INFO L272 TraceCheckUtils]: 132: Hoare triple {43103#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,950 INFO L290 TraceCheckUtils]: 133: Hoare triple {43103#(<= ~counter~0 9)} ~cond := #in~cond; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,950 INFO L290 TraceCheckUtils]: 134: Hoare triple {43103#(<= ~counter~0 9)} assume !(0 == ~cond); {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,950 INFO L290 TraceCheckUtils]: 135: Hoare triple {43103#(<= ~counter~0 9)} assume true; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,951 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {43103#(<= ~counter~0 9)} {43103#(<= ~counter~0 9)} #84#return; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,951 INFO L272 TraceCheckUtils]: 137: Hoare triple {43103#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,952 INFO L290 TraceCheckUtils]: 138: Hoare triple {43103#(<= ~counter~0 9)} ~cond := #in~cond; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,952 INFO L290 TraceCheckUtils]: 139: Hoare triple {43103#(<= ~counter~0 9)} assume !(0 == ~cond); {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,952 INFO L290 TraceCheckUtils]: 140: Hoare triple {43103#(<= ~counter~0 9)} assume true; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,953 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {43103#(<= ~counter~0 9)} {43103#(<= ~counter~0 9)} #86#return; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,953 INFO L290 TraceCheckUtils]: 142: Hoare triple {43103#(<= ~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); {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,953 INFO L290 TraceCheckUtils]: 143: Hoare triple {43103#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43103#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:10,954 INFO L290 TraceCheckUtils]: 144: Hoare triple {43103#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43146#(<= |main_#t~post6| 9)} is VALID [2022-04-08 13:26:10,954 INFO L290 TraceCheckUtils]: 145: Hoare triple {43146#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {42700#false} is VALID [2022-04-08 13:26:10,954 INFO L272 TraceCheckUtils]: 146: Hoare triple {42700#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42700#false} is VALID [2022-04-08 13:26:10,954 INFO L290 TraceCheckUtils]: 147: Hoare triple {42700#false} ~cond := #in~cond; {42700#false} is VALID [2022-04-08 13:26:10,954 INFO L290 TraceCheckUtils]: 148: Hoare triple {42700#false} assume 0 == ~cond; {42700#false} is VALID [2022-04-08 13:26:10,954 INFO L290 TraceCheckUtils]: 149: Hoare triple {42700#false} assume !false; {42700#false} is VALID [2022-04-08 13:26:10,955 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-08 13:26:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:26:11,596 INFO L290 TraceCheckUtils]: 149: Hoare triple {42700#false} assume !false; {42700#false} is VALID [2022-04-08 13:26:11,596 INFO L290 TraceCheckUtils]: 148: Hoare triple {42700#false} assume 0 == ~cond; {42700#false} is VALID [2022-04-08 13:26:11,596 INFO L290 TraceCheckUtils]: 147: Hoare triple {42700#false} ~cond := #in~cond; {42700#false} is VALID [2022-04-08 13:26:11,596 INFO L272 TraceCheckUtils]: 146: Hoare triple {42700#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42700#false} is VALID [2022-04-08 13:26:11,596 INFO L290 TraceCheckUtils]: 145: Hoare triple {43174#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {42700#false} is VALID [2022-04-08 13:26:11,597 INFO L290 TraceCheckUtils]: 144: Hoare triple {43178#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43174#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:26:11,597 INFO L290 TraceCheckUtils]: 143: Hoare triple {43178#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,597 INFO L290 TraceCheckUtils]: 142: Hoare triple {43178#(< ~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); {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,598 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42699#true} {43178#(< ~counter~0 20)} #86#return; {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,598 INFO L290 TraceCheckUtils]: 140: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,598 INFO L290 TraceCheckUtils]: 139: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,598 INFO L290 TraceCheckUtils]: 138: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,598 INFO L272 TraceCheckUtils]: 137: Hoare triple {43178#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,599 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42699#true} {43178#(< ~counter~0 20)} #84#return; {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,599 INFO L290 TraceCheckUtils]: 135: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,599 INFO L290 TraceCheckUtils]: 134: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,599 INFO L290 TraceCheckUtils]: 133: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,599 INFO L272 TraceCheckUtils]: 132: Hoare triple {43178#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,599 INFO L290 TraceCheckUtils]: 131: Hoare triple {43178#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,600 INFO L290 TraceCheckUtils]: 130: Hoare triple {43221#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43178#(< ~counter~0 20)} is VALID [2022-04-08 13:26:11,600 INFO L290 TraceCheckUtils]: 129: Hoare triple {43221#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {43221#(< ~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); {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,601 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42699#true} {43221#(< ~counter~0 19)} #86#return; {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,601 INFO L272 TraceCheckUtils]: 123: Hoare triple {43221#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,602 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42699#true} {43221#(< ~counter~0 19)} #84#return; {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,602 INFO L290 TraceCheckUtils]: 121: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,602 INFO L290 TraceCheckUtils]: 120: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,602 INFO L290 TraceCheckUtils]: 119: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,602 INFO L272 TraceCheckUtils]: 118: Hoare triple {43221#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {43221#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,603 INFO L290 TraceCheckUtils]: 116: Hoare triple {43264#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43221#(< ~counter~0 19)} is VALID [2022-04-08 13:26:11,604 INFO L290 TraceCheckUtils]: 115: Hoare triple {43264#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,604 INFO L290 TraceCheckUtils]: 114: Hoare triple {43264#(< ~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); {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,604 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42699#true} {43264#(< ~counter~0 18)} #86#return; {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,604 INFO L290 TraceCheckUtils]: 112: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,604 INFO L290 TraceCheckUtils]: 111: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L272 TraceCheckUtils]: 109: Hoare triple {43264#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42699#true} {43264#(< ~counter~0 18)} #84#return; {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,605 INFO L290 TraceCheckUtils]: 107: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L290 TraceCheckUtils]: 106: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L290 TraceCheckUtils]: 105: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,605 INFO L272 TraceCheckUtils]: 104: Hoare triple {43264#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,606 INFO L290 TraceCheckUtils]: 103: Hoare triple {43264#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,606 INFO L290 TraceCheckUtils]: 102: Hoare triple {43307#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43264#(< ~counter~0 18)} is VALID [2022-04-08 13:26:11,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {43307#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,607 INFO L290 TraceCheckUtils]: 100: Hoare triple {43307#(< ~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); {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,607 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42699#true} {43307#(< ~counter~0 17)} #86#return; {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,607 INFO L290 TraceCheckUtils]: 98: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,607 INFO L290 TraceCheckUtils]: 97: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L290 TraceCheckUtils]: 96: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L272 TraceCheckUtils]: 95: Hoare triple {43307#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42699#true} {43307#(< ~counter~0 17)} #84#return; {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L290 TraceCheckUtils]: 92: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L290 TraceCheckUtils]: 91: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,608 INFO L272 TraceCheckUtils]: 90: Hoare triple {43307#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {43307#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {43350#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43307#(< ~counter~0 17)} is VALID [2022-04-08 13:26:11,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {43350#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,610 INFO L290 TraceCheckUtils]: 86: Hoare triple {43350#(< ~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); {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,610 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42699#true} {43350#(< ~counter~0 16)} #86#return; {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,610 INFO L290 TraceCheckUtils]: 84: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,610 INFO L272 TraceCheckUtils]: 81: Hoare triple {43350#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,611 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42699#true} {43350#(< ~counter~0 16)} #84#return; {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,611 INFO L290 TraceCheckUtils]: 79: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,611 INFO L290 TraceCheckUtils]: 78: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,611 INFO L272 TraceCheckUtils]: 76: Hoare triple {43350#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {43350#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {43393#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43350#(< ~counter~0 16)} is VALID [2022-04-08 13:26:11,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {43393#(< ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {43393#(< ~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); {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,613 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42699#true} {43393#(< ~counter~0 15)} #86#return; {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,613 INFO L290 TraceCheckUtils]: 69: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,613 INFO L272 TraceCheckUtils]: 67: Hoare triple {43393#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,614 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42699#true} {43393#(< ~counter~0 15)} #84#return; {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,614 INFO L272 TraceCheckUtils]: 62: Hoare triple {43393#(< ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {43393#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {43436#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43393#(< ~counter~0 15)} is VALID [2022-04-08 13:26:11,616 INFO L290 TraceCheckUtils]: 59: Hoare triple {43436#(< ~counter~0 14)} assume !(~r~0 >= ~d~0); {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,616 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42699#true} {43436#(< ~counter~0 14)} #82#return; {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,616 INFO L272 TraceCheckUtils]: 54: Hoare triple {43436#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42699#true} {43436#(< ~counter~0 14)} #80#return; {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L272 TraceCheckUtils]: 49: Hoare triple {43436#(< ~counter~0 14)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42699#true} {43436#(< ~counter~0 14)} #78#return; {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,618 INFO L272 TraceCheckUtils]: 44: Hoare triple {43436#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {43436#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {43491#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43436#(< ~counter~0 14)} is VALID [2022-04-08 13:26:11,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {43491#(< ~counter~0 13)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,619 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42699#true} {43491#(< ~counter~0 13)} #82#return; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L272 TraceCheckUtils]: 36: Hoare triple {43491#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42699#true} {43491#(< ~counter~0 13)} #80#return; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,620 INFO L272 TraceCheckUtils]: 31: Hoare triple {43491#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,621 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42699#true} {43491#(< ~counter~0 13)} #78#return; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {43491#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {43491#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {43546#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43491#(< ~counter~0 13)} is VALID [2022-04-08 13:26:11,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {43546#(< ~counter~0 12)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42699#true} {43546#(< ~counter~0 12)} #82#return; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L272 TraceCheckUtils]: 18: Hoare triple {43546#(< ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42699#true} {43546#(< ~counter~0 12)} #80#return; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L272 TraceCheckUtils]: 13: Hoare triple {43546#(< ~counter~0 12)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42699#true} {43546#(< ~counter~0 12)} #78#return; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {42699#true} assume true; {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {42699#true} assume !(0 == ~cond); {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {42699#true} ~cond := #in~cond; {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L272 TraceCheckUtils]: 8: Hoare triple {43546#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42699#true} is VALID [2022-04-08 13:26:11,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {43546#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {43601#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43546#(< ~counter~0 12)} is VALID [2022-04-08 13:26:11,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {43601#(< ~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; {43601#(< ~counter~0 11)} is VALID [2022-04-08 13:26:11,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {43601#(< ~counter~0 11)} call #t~ret7 := main(); {43601#(< ~counter~0 11)} is VALID [2022-04-08 13:26:11,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43601#(< ~counter~0 11)} {42699#true} #92#return; {43601#(< ~counter~0 11)} is VALID [2022-04-08 13:26:11,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {43601#(< ~counter~0 11)} assume true; {43601#(< ~counter~0 11)} is VALID [2022-04-08 13:26:11,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {42699#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; {43601#(< ~counter~0 11)} is VALID [2022-04-08 13:26:11,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {42699#true} call ULTIMATE.init(); {42699#true} is VALID [2022-04-08 13:26:11,628 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-08 13:26:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:11,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389249922] [2022-04-08 13:26:11,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:11,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712234579] [2022-04-08 13:26:11,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712234579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:26:11,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:26:11,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 13:26:11,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:11,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992825070] [2022-04-08 13:26:11,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992825070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:11,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:11,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 13:26:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929914809] [2022-04-08 13:26:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:11,629 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-08 13:26:11,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:11,630 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-08 13:26:11,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:11,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 13:26:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:11,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 13:26:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 13:26:11,728 INFO L87 Difference]: Start difference. First operand 479 states and 529 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-08 13:26:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:13,227 INFO L93 Difference]: Finished difference Result 581 states and 653 transitions. [2022-04-08 13:26:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 13:26:13,227 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-08 13:26:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:13,227 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-08 13:26:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-08 13:26:13,229 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-08 13:26:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-08 13:26:13,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 216 transitions. [2022-04-08 13:26:13,367 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-08 13:26:13,381 INFO L225 Difference]: With dead ends: 581 [2022-04-08 13:26:13,382 INFO L226 Difference]: Without dead ends: 568 [2022-04-08 13:26:13,382 INFO L912 BasicCegarLoop]: 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-08 13:26:13,383 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 101 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:13,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 260 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 13:26:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-08 13:26:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2022-04-08 13:26:14,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:14,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-08 13:26:14,051 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-08 13:26:14,052 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-08 13:26:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:14,062 INFO L93 Difference]: Finished difference Result 568 states and 632 transitions. [2022-04-08 13:26:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 632 transitions. [2022-04-08 13:26:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:14,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:14,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 568 states. [2022-04-08 13:26:14,063 INFO L87 Difference]: Start difference. First operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 568 states. [2022-04-08 13:26:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:14,074 INFO L93 Difference]: Finished difference Result 568 states and 632 transitions. [2022-04-08 13:26:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 632 transitions. [2022-04-08 13:26:14,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:14,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:14,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:14,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-08 13:26:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 631 transitions. [2022-04-08 13:26:14,089 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 631 transitions. Word has length 150 [2022-04-08 13:26:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:14,089 INFO L478 AbstractCegarLoop]: Abstraction has 567 states and 631 transitions. [2022-04-08 13:26:14,090 INFO L479 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-08 13:26:14,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 631 transitions. [2022-04-08 13:26:15,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 631 transitions. [2022-04-08 13:26:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 13:26:15,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:15,220 INFO L499 BasicCegarLoop]: 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-08 13:26:15,237 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-08 13:26:15,420 WARN L460 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-08 13:26:15,420 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 15 times [2022-04-08 13:26:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181399626] [2022-04-08 13:26:19,028 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:19,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 16 times [2022-04-08 13:26:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:19,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255134748] [2022-04-08 13:26:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:19,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:19,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718000867] [2022-04-08 13:26:19,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:26:19,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:19,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:19,044 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:19,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 13:26:25,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:26:25,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:25,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 13:26:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:25,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:26,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {47066#true} call ULTIMATE.init(); {47066#true} is VALID [2022-04-08 13:26:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {47066#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; {47074#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:26,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {47074#(<= ~counter~0 0)} assume true; {47074#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:26,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47074#(<= ~counter~0 0)} {47066#true} #92#return; {47074#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:26,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {47074#(<= ~counter~0 0)} call #t~ret7 := main(); {47074#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:26,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {47074#(<= ~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; {47074#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:26,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {47074#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {47090#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {47090#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {47090#(<= ~counter~0 1)} ~cond := #in~cond; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {47090#(<= ~counter~0 1)} assume !(0 == ~cond); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {47090#(<= ~counter~0 1)} assume true; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,413 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {47090#(<= ~counter~0 1)} {47090#(<= ~counter~0 1)} #78#return; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,414 INFO L272 TraceCheckUtils]: 13: Hoare triple {47090#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {47090#(<= ~counter~0 1)} ~cond := #in~cond; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {47090#(<= ~counter~0 1)} assume !(0 == ~cond); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {47090#(<= ~counter~0 1)} assume true; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,415 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {47090#(<= ~counter~0 1)} {47090#(<= ~counter~0 1)} #80#return; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,415 INFO L272 TraceCheckUtils]: 18: Hoare triple {47090#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {47090#(<= ~counter~0 1)} ~cond := #in~cond; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {47090#(<= ~counter~0 1)} assume !(0 == ~cond); {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {47090#(<= ~counter~0 1)} assume true; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,416 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47090#(<= ~counter~0 1)} {47090#(<= ~counter~0 1)} #82#return; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {47090#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47090#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:26,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {47090#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {47145#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,418 INFO L272 TraceCheckUtils]: 26: Hoare triple {47145#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {47145#(<= ~counter~0 2)} ~cond := #in~cond; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {47145#(<= ~counter~0 2)} assume !(0 == ~cond); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {47145#(<= ~counter~0 2)} assume true; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,419 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {47145#(<= ~counter~0 2)} {47145#(<= ~counter~0 2)} #78#return; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,419 INFO L272 TraceCheckUtils]: 31: Hoare triple {47145#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {47145#(<= ~counter~0 2)} ~cond := #in~cond; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {47145#(<= ~counter~0 2)} assume !(0 == ~cond); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {47145#(<= ~counter~0 2)} assume true; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,421 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {47145#(<= ~counter~0 2)} {47145#(<= ~counter~0 2)} #80#return; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,421 INFO L272 TraceCheckUtils]: 36: Hoare triple {47145#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {47145#(<= ~counter~0 2)} ~cond := #in~cond; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {47145#(<= ~counter~0 2)} assume !(0 == ~cond); {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {47145#(<= ~counter~0 2)} assume true; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,422 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47145#(<= ~counter~0 2)} {47145#(<= ~counter~0 2)} #82#return; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {47145#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47145#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:26,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {47145#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {47200#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,424 INFO L272 TraceCheckUtils]: 44: Hoare triple {47200#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {47200#(<= ~counter~0 3)} ~cond := #in~cond; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {47200#(<= ~counter~0 3)} assume !(0 == ~cond); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {47200#(<= ~counter~0 3)} assume true; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,425 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47200#(<= ~counter~0 3)} {47200#(<= ~counter~0 3)} #78#return; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,426 INFO L272 TraceCheckUtils]: 49: Hoare triple {47200#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {47200#(<= ~counter~0 3)} ~cond := #in~cond; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {47200#(<= ~counter~0 3)} assume !(0 == ~cond); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {47200#(<= ~counter~0 3)} assume true; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,427 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47200#(<= ~counter~0 3)} {47200#(<= ~counter~0 3)} #80#return; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,427 INFO L272 TraceCheckUtils]: 54: Hoare triple {47200#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {47200#(<= ~counter~0 3)} ~cond := #in~cond; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {47200#(<= ~counter~0 3)} assume !(0 == ~cond); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {47200#(<= ~counter~0 3)} assume true; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,428 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47200#(<= ~counter~0 3)} {47200#(<= ~counter~0 3)} #82#return; {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {47200#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {47200#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:26,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {47200#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {47255#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,430 INFO L272 TraceCheckUtils]: 62: Hoare triple {47255#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {47255#(<= ~counter~0 4)} ~cond := #in~cond; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {47255#(<= ~counter~0 4)} assume !(0 == ~cond); {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {47255#(<= ~counter~0 4)} assume true; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,431 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47255#(<= ~counter~0 4)} {47255#(<= ~counter~0 4)} #84#return; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,432 INFO L272 TraceCheckUtils]: 67: Hoare triple {47255#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {47255#(<= ~counter~0 4)} ~cond := #in~cond; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {47255#(<= ~counter~0 4)} assume !(0 == ~cond); {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {47255#(<= ~counter~0 4)} assume true; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,433 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47255#(<= ~counter~0 4)} {47255#(<= ~counter~0 4)} #86#return; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {47255#(<= ~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); {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {47255#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47255#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:26,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {47255#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {47298#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,435 INFO L272 TraceCheckUtils]: 76: Hoare triple {47298#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {47298#(<= ~counter~0 5)} ~cond := #in~cond; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,435 INFO L290 TraceCheckUtils]: 78: Hoare triple {47298#(<= ~counter~0 5)} assume !(0 == ~cond); {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,436 INFO L290 TraceCheckUtils]: 79: Hoare triple {47298#(<= ~counter~0 5)} assume true; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,436 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47298#(<= ~counter~0 5)} {47298#(<= ~counter~0 5)} #84#return; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,436 INFO L272 TraceCheckUtils]: 81: Hoare triple {47298#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {47298#(<= ~counter~0 5)} ~cond := #in~cond; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {47298#(<= ~counter~0 5)} assume !(0 == ~cond); {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {47298#(<= ~counter~0 5)} assume true; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,438 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47298#(<= ~counter~0 5)} {47298#(<= ~counter~0 5)} #86#return; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {47298#(<= ~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); {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {47298#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47298#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:26,439 INFO L290 TraceCheckUtils]: 88: Hoare triple {47298#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,439 INFO L290 TraceCheckUtils]: 89: Hoare triple {47341#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,440 INFO L272 TraceCheckUtils]: 90: Hoare triple {47341#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,440 INFO L290 TraceCheckUtils]: 91: Hoare triple {47341#(<= ~counter~0 6)} ~cond := #in~cond; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,440 INFO L290 TraceCheckUtils]: 92: Hoare triple {47341#(<= ~counter~0 6)} assume !(0 == ~cond); {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,441 INFO L290 TraceCheckUtils]: 93: Hoare triple {47341#(<= ~counter~0 6)} assume true; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,441 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47341#(<= ~counter~0 6)} {47341#(<= ~counter~0 6)} #84#return; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,441 INFO L272 TraceCheckUtils]: 95: Hoare triple {47341#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {47341#(<= ~counter~0 6)} ~cond := #in~cond; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {47341#(<= ~counter~0 6)} assume !(0 == ~cond); {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {47341#(<= ~counter~0 6)} assume true; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,443 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47341#(<= ~counter~0 6)} {47341#(<= ~counter~0 6)} #86#return; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,443 INFO L290 TraceCheckUtils]: 100: Hoare triple {47341#(<= ~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); {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,443 INFO L290 TraceCheckUtils]: 101: Hoare triple {47341#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47341#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:26,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {47341#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,444 INFO L290 TraceCheckUtils]: 103: Hoare triple {47384#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,445 INFO L272 TraceCheckUtils]: 104: Hoare triple {47384#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,445 INFO L290 TraceCheckUtils]: 105: Hoare triple {47384#(<= ~counter~0 7)} ~cond := #in~cond; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,445 INFO L290 TraceCheckUtils]: 106: Hoare triple {47384#(<= ~counter~0 7)} assume !(0 == ~cond); {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,445 INFO L290 TraceCheckUtils]: 107: Hoare triple {47384#(<= ~counter~0 7)} assume true; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,446 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47384#(<= ~counter~0 7)} {47384#(<= ~counter~0 7)} #84#return; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,446 INFO L272 TraceCheckUtils]: 109: Hoare triple {47384#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,447 INFO L290 TraceCheckUtils]: 110: Hoare triple {47384#(<= ~counter~0 7)} ~cond := #in~cond; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,447 INFO L290 TraceCheckUtils]: 111: Hoare triple {47384#(<= ~counter~0 7)} assume !(0 == ~cond); {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,447 INFO L290 TraceCheckUtils]: 112: Hoare triple {47384#(<= ~counter~0 7)} assume true; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,447 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47384#(<= ~counter~0 7)} {47384#(<= ~counter~0 7)} #86#return; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,448 INFO L290 TraceCheckUtils]: 114: Hoare triple {47384#(<= ~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); {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,448 INFO L290 TraceCheckUtils]: 115: Hoare triple {47384#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47384#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:26,449 INFO L290 TraceCheckUtils]: 116: Hoare triple {47384#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,449 INFO L290 TraceCheckUtils]: 117: Hoare triple {47427#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,449 INFO L272 TraceCheckUtils]: 118: Hoare triple {47427#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,450 INFO L290 TraceCheckUtils]: 119: Hoare triple {47427#(<= ~counter~0 8)} ~cond := #in~cond; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,450 INFO L290 TraceCheckUtils]: 120: Hoare triple {47427#(<= ~counter~0 8)} assume !(0 == ~cond); {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,450 INFO L290 TraceCheckUtils]: 121: Hoare triple {47427#(<= ~counter~0 8)} assume true; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,450 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47427#(<= ~counter~0 8)} {47427#(<= ~counter~0 8)} #84#return; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,451 INFO L272 TraceCheckUtils]: 123: Hoare triple {47427#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,451 INFO L290 TraceCheckUtils]: 124: Hoare triple {47427#(<= ~counter~0 8)} ~cond := #in~cond; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,451 INFO L290 TraceCheckUtils]: 125: Hoare triple {47427#(<= ~counter~0 8)} assume !(0 == ~cond); {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,452 INFO L290 TraceCheckUtils]: 126: Hoare triple {47427#(<= ~counter~0 8)} assume true; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,452 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47427#(<= ~counter~0 8)} {47427#(<= ~counter~0 8)} #86#return; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,452 INFO L290 TraceCheckUtils]: 128: Hoare triple {47427#(<= ~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); {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,452 INFO L290 TraceCheckUtils]: 129: Hoare triple {47427#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47427#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:26,454 INFO L290 TraceCheckUtils]: 130: Hoare triple {47427#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,454 INFO L290 TraceCheckUtils]: 131: Hoare triple {47470#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,454 INFO L272 TraceCheckUtils]: 132: Hoare triple {47470#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,455 INFO L290 TraceCheckUtils]: 133: Hoare triple {47470#(<= ~counter~0 9)} ~cond := #in~cond; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,455 INFO L290 TraceCheckUtils]: 134: Hoare triple {47470#(<= ~counter~0 9)} assume !(0 == ~cond); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,455 INFO L290 TraceCheckUtils]: 135: Hoare triple {47470#(<= ~counter~0 9)} assume true; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,455 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47470#(<= ~counter~0 9)} {47470#(<= ~counter~0 9)} #84#return; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,456 INFO L272 TraceCheckUtils]: 137: Hoare triple {47470#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,456 INFO L290 TraceCheckUtils]: 138: Hoare triple {47470#(<= ~counter~0 9)} ~cond := #in~cond; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,456 INFO L290 TraceCheckUtils]: 139: Hoare triple {47470#(<= ~counter~0 9)} assume !(0 == ~cond); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,457 INFO L290 TraceCheckUtils]: 140: Hoare triple {47470#(<= ~counter~0 9)} assume true; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,457 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47470#(<= ~counter~0 9)} {47470#(<= ~counter~0 9)} #86#return; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,457 INFO L290 TraceCheckUtils]: 142: Hoare triple {47470#(<= ~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); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,457 INFO L290 TraceCheckUtils]: 143: Hoare triple {47470#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:26,458 INFO L290 TraceCheckUtils]: 144: Hoare triple {47470#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,459 INFO L290 TraceCheckUtils]: 145: Hoare triple {47513#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,459 INFO L272 TraceCheckUtils]: 146: Hoare triple {47513#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,459 INFO L290 TraceCheckUtils]: 147: Hoare triple {47513#(<= ~counter~0 10)} ~cond := #in~cond; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,460 INFO L290 TraceCheckUtils]: 148: Hoare triple {47513#(<= ~counter~0 10)} assume !(0 == ~cond); {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,460 INFO L290 TraceCheckUtils]: 149: Hoare triple {47513#(<= ~counter~0 10)} assume true; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,460 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47513#(<= ~counter~0 10)} {47513#(<= ~counter~0 10)} #84#return; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,461 INFO L272 TraceCheckUtils]: 151: Hoare triple {47513#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,461 INFO L290 TraceCheckUtils]: 152: Hoare triple {47513#(<= ~counter~0 10)} ~cond := #in~cond; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,461 INFO L290 TraceCheckUtils]: 153: Hoare triple {47513#(<= ~counter~0 10)} assume !(0 == ~cond); {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,461 INFO L290 TraceCheckUtils]: 154: Hoare triple {47513#(<= ~counter~0 10)} assume true; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,462 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47513#(<= ~counter~0 10)} {47513#(<= ~counter~0 10)} #86#return; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,462 INFO L290 TraceCheckUtils]: 156: Hoare triple {47513#(<= ~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); {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,462 INFO L290 TraceCheckUtils]: 157: Hoare triple {47513#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:26,463 INFO L290 TraceCheckUtils]: 158: Hoare triple {47513#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47556#(<= |main_#t~post6| 10)} is VALID [2022-04-08 13:26:26,463 INFO L290 TraceCheckUtils]: 159: Hoare triple {47556#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {47067#false} is VALID [2022-04-08 13:26:26,463 INFO L272 TraceCheckUtils]: 160: Hoare triple {47067#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {47067#false} is VALID [2022-04-08 13:26:26,463 INFO L290 TraceCheckUtils]: 161: Hoare triple {47067#false} ~cond := #in~cond; {47067#false} is VALID [2022-04-08 13:26:26,463 INFO L290 TraceCheckUtils]: 162: Hoare triple {47067#false} assume 0 == ~cond; {47067#false} is VALID [2022-04-08 13:26:26,463 INFO L290 TraceCheckUtils]: 163: Hoare triple {47067#false} assume !false; {47067#false} is VALID [2022-04-08 13:26:26,464 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-08 13:26:26,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:26:27,172 INFO L290 TraceCheckUtils]: 163: Hoare triple {47067#false} assume !false; {47067#false} is VALID [2022-04-08 13:26:27,172 INFO L290 TraceCheckUtils]: 162: Hoare triple {47067#false} assume 0 == ~cond; {47067#false} is VALID [2022-04-08 13:26:27,172 INFO L290 TraceCheckUtils]: 161: Hoare triple {47067#false} ~cond := #in~cond; {47067#false} is VALID [2022-04-08 13:26:27,172 INFO L272 TraceCheckUtils]: 160: Hoare triple {47067#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {47067#false} is VALID [2022-04-08 13:26:27,172 INFO L290 TraceCheckUtils]: 159: Hoare triple {47584#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {47067#false} is VALID [2022-04-08 13:26:27,173 INFO L290 TraceCheckUtils]: 158: Hoare triple {47588#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47584#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:26:27,173 INFO L290 TraceCheckUtils]: 157: Hoare triple {47588#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,173 INFO L290 TraceCheckUtils]: 156: Hoare triple {47588#(< ~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); {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,174 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47066#true} {47588#(< ~counter~0 20)} #86#return; {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,174 INFO L290 TraceCheckUtils]: 154: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,174 INFO L290 TraceCheckUtils]: 153: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,174 INFO L290 TraceCheckUtils]: 152: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,174 INFO L272 TraceCheckUtils]: 151: Hoare triple {47588#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,174 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47066#true} {47588#(< ~counter~0 20)} #84#return; {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,174 INFO L290 TraceCheckUtils]: 149: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,175 INFO L290 TraceCheckUtils]: 148: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,175 INFO L290 TraceCheckUtils]: 147: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,175 INFO L272 TraceCheckUtils]: 146: Hoare triple {47588#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,175 INFO L290 TraceCheckUtils]: 145: Hoare triple {47588#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,176 INFO L290 TraceCheckUtils]: 144: Hoare triple {47631#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47588#(< ~counter~0 20)} is VALID [2022-04-08 13:26:27,176 INFO L290 TraceCheckUtils]: 143: Hoare triple {47631#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,177 INFO L290 TraceCheckUtils]: 142: Hoare triple {47631#(< ~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); {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,177 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47066#true} {47631#(< ~counter~0 19)} #86#return; {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,177 INFO L290 TraceCheckUtils]: 140: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,177 INFO L290 TraceCheckUtils]: 139: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L290 TraceCheckUtils]: 138: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L272 TraceCheckUtils]: 137: Hoare triple {47631#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47066#true} {47631#(< ~counter~0 19)} #84#return; {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,178 INFO L290 TraceCheckUtils]: 135: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L290 TraceCheckUtils]: 134: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L290 TraceCheckUtils]: 133: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,178 INFO L272 TraceCheckUtils]: 132: Hoare triple {47631#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,179 INFO L290 TraceCheckUtils]: 131: Hoare triple {47631#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,180 INFO L290 TraceCheckUtils]: 130: Hoare triple {47674#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47631#(< ~counter~0 19)} is VALID [2022-04-08 13:26:27,180 INFO L290 TraceCheckUtils]: 129: Hoare triple {47674#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,180 INFO L290 TraceCheckUtils]: 128: Hoare triple {47674#(< ~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); {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,181 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47066#true} {47674#(< ~counter~0 18)} #86#return; {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,181 INFO L290 TraceCheckUtils]: 126: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,181 INFO L290 TraceCheckUtils]: 125: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,181 INFO L290 TraceCheckUtils]: 124: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,181 INFO L272 TraceCheckUtils]: 123: Hoare triple {47674#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,182 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47066#true} {47674#(< ~counter~0 18)} #84#return; {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,182 INFO L290 TraceCheckUtils]: 121: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,182 INFO L290 TraceCheckUtils]: 120: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,182 INFO L290 TraceCheckUtils]: 119: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,182 INFO L272 TraceCheckUtils]: 118: Hoare triple {47674#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,182 INFO L290 TraceCheckUtils]: 117: Hoare triple {47674#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {47717#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47674#(< ~counter~0 18)} is VALID [2022-04-08 13:26:27,183 INFO L290 TraceCheckUtils]: 115: Hoare triple {47717#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,184 INFO L290 TraceCheckUtils]: 114: Hoare triple {47717#(< ~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); {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,184 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47066#true} {47717#(< ~counter~0 17)} #86#return; {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,184 INFO L290 TraceCheckUtils]: 112: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,184 INFO L290 TraceCheckUtils]: 111: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,184 INFO L290 TraceCheckUtils]: 110: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,184 INFO L272 TraceCheckUtils]: 109: Hoare triple {47717#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,185 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47066#true} {47717#(< ~counter~0 17)} #84#return; {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,185 INFO L272 TraceCheckUtils]: 104: Hoare triple {47717#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {47717#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {47760#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47717#(< ~counter~0 17)} is VALID [2022-04-08 13:26:27,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {47760#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {47760#(< ~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); {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,187 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47066#true} {47760#(< ~counter~0 16)} #86#return; {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,188 INFO L272 TraceCheckUtils]: 95: Hoare triple {47760#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,188 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47066#true} {47760#(< ~counter~0 16)} #84#return; {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,188 INFO L272 TraceCheckUtils]: 90: Hoare triple {47760#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {47760#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,189 INFO L290 TraceCheckUtils]: 88: Hoare triple {47803#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47760#(< ~counter~0 16)} is VALID [2022-04-08 13:26:27,190 INFO L290 TraceCheckUtils]: 87: Hoare triple {47803#(< ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,190 INFO L290 TraceCheckUtils]: 86: Hoare triple {47803#(< ~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); {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,190 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47066#true} {47803#(< ~counter~0 15)} #86#return; {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L272 TraceCheckUtils]: 81: Hoare triple {47803#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47066#true} {47803#(< ~counter~0 15)} #84#return; {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,191 INFO L290 TraceCheckUtils]: 79: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L290 TraceCheckUtils]: 78: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,191 INFO L272 TraceCheckUtils]: 76: Hoare triple {47803#(< ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,192 INFO L290 TraceCheckUtils]: 75: Hoare triple {47803#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {47846#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47803#(< ~counter~0 15)} is VALID [2022-04-08 13:26:27,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {47846#(< ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {47846#(< ~counter~0 14)} 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); {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,194 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47066#true} {47846#(< ~counter~0 14)} #86#return; {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,194 INFO L272 TraceCheckUtils]: 67: Hoare triple {47846#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,195 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47066#true} {47846#(< ~counter~0 14)} #84#return; {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,195 INFO L272 TraceCheckUtils]: 62: Hoare triple {47846#(< ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {47846#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {47889#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47846#(< ~counter~0 14)} is VALID [2022-04-08 13:26:27,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {47889#(< ~counter~0 13)} assume !(~r~0 >= ~d~0); {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,197 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47066#true} {47889#(< ~counter~0 13)} #82#return; {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,198 INFO L272 TraceCheckUtils]: 54: Hoare triple {47889#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,198 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47066#true} {47889#(< ~counter~0 13)} #80#return; {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,198 INFO L272 TraceCheckUtils]: 49: Hoare triple {47889#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,199 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47066#true} {47889#(< ~counter~0 13)} #78#return; {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,199 INFO L272 TraceCheckUtils]: 44: Hoare triple {47889#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {47889#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {47944#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47889#(< ~counter~0 13)} is VALID [2022-04-08 13:26:27,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {47944#(< ~counter~0 12)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,201 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47066#true} {47944#(< ~counter~0 12)} #82#return; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,201 INFO L272 TraceCheckUtils]: 36: Hoare triple {47944#(< ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {47066#true} {47944#(< ~counter~0 12)} #80#return; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L272 TraceCheckUtils]: 31: Hoare triple {47944#(< ~counter~0 12)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {47066#true} {47944#(< ~counter~0 12)} #78#return; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,203 INFO L272 TraceCheckUtils]: 26: Hoare triple {47944#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {47944#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {47513#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47944#(< ~counter~0 12)} is VALID [2022-04-08 13:26:27,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {47513#(<= ~counter~0 10)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,204 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47066#true} {47513#(<= ~counter~0 10)} #82#return; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L272 TraceCheckUtils]: 18: Hoare triple {47513#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {47066#true} {47513#(<= ~counter~0 10)} #80#return; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {47513#(<= ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,206 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {47066#true} {47513#(<= ~counter~0 10)} #78#return; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {47066#true} assume true; {47066#true} is VALID [2022-04-08 13:26:27,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {47066#true} assume !(0 == ~cond); {47066#true} is VALID [2022-04-08 13:26:27,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {47066#true} ~cond := #in~cond; {47066#true} is VALID [2022-04-08 13:26:27,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {47513#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47066#true} is VALID [2022-04-08 13:26:27,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {47513#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {47470#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47513#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:27,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {47470#(<= ~counter~0 9)} 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; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:27,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {47470#(<= ~counter~0 9)} call #t~ret7 := main(); {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:27,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47470#(<= ~counter~0 9)} {47066#true} #92#return; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:27,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {47470#(<= ~counter~0 9)} assume true; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:27,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {47066#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; {47470#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:27,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {47066#true} call ULTIMATE.init(); {47066#true} is VALID [2022-04-08 13:26:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 46 proven. 158 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-08 13:26:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:27,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255134748] [2022-04-08 13:26:27,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:27,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718000867] [2022-04-08 13:26:27,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718000867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:26:27,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:26:27,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 13:26:27,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:27,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181399626] [2022-04-08 13:26:27,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181399626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:27,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:27,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 13:26:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076281916] [2022-04-08 13:26:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 164 [2022-04-08 13:26:27,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:27,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-08 13:26:27,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:27,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 13:26:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 13:26:27,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 13:26:27,328 INFO L87 Difference]: Start difference. First operand 567 states and 631 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-08 13:26:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:28,719 INFO L93 Difference]: Finished difference Result 675 states and 762 transitions. [2022-04-08 13:26:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 13:26:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 164 [2022-04-08 13:26:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-08 13:26:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-08 13:26:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-08 13:26:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-08 13:26:28,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 239 transitions. [2022-04-08 13:26:28,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:28,890 INFO L225 Difference]: With dead ends: 675 [2022-04-08 13:26:28,890 INFO L226 Difference]: Without dead ends: 662 [2022-04-08 13:26:28,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=554, Unknown=0, NotChecked=0, Total=930 [2022-04-08 13:26:28,891 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 144 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:28,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 262 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:26:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-08 13:26:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 661. [2022-04-08 13:26:29,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:29,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-08 13:26:29,672 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-08 13:26:29,672 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-08 13:26:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:29,684 INFO L93 Difference]: Finished difference Result 662 states and 741 transitions. [2022-04-08 13:26:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 741 transitions. [2022-04-08 13:26:29,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:29,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:29,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 662 states. [2022-04-08 13:26:29,686 INFO L87 Difference]: Start difference. First operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 662 states. [2022-04-08 13:26:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:29,698 INFO L93 Difference]: Finished difference Result 662 states and 741 transitions. [2022-04-08 13:26:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 741 transitions. [2022-04-08 13:26:29,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:29,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:29,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:29,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-08 13:26:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 740 transitions. [2022-04-08 13:26:29,718 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 740 transitions. Word has length 164 [2022-04-08 13:26:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:29,718 INFO L478 AbstractCegarLoop]: Abstraction has 661 states and 740 transitions. [2022-04-08 13:26:29,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-08 13:26:29,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 661 states and 740 transitions. [2022-04-08 13:26:31,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 740 edges. 740 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 740 transitions. [2022-04-08 13:26:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 13:26:31,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:31,098 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:26:31,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:31,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:31,298 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 17 times [2022-04-08 13:26:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:31,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378822816] [2022-04-08 13:26:35,376 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:35,376 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 18 times [2022-04-08 13:26:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:35,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281965750] [2022-04-08 13:26:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:35,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:35,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276919124] [2022-04-08 13:26:35,392 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:26:35,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:35,393 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:35,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 13:26:35,519 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 13:26:35,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:35,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 13:26:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:35,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:35,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {52083#true} call ULTIMATE.init(); {52083#true} is VALID [2022-04-08 13:26:35,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {52083#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; {52083#true} is VALID [2022-04-08 13:26:35,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52083#true} {52083#true} #92#return; {52083#true} is VALID [2022-04-08 13:26:35,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {52083#true} call #t~ret7 := main(); {52083#true} is VALID [2022-04-08 13:26:35,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {52083#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; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {52103#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {52103#(= main_~p~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,861 INFO L272 TraceCheckUtils]: 8: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,862 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #78#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,862 INFO L272 TraceCheckUtils]: 13: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,862 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #80#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,863 INFO L272 TraceCheckUtils]: 18: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,863 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #82#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {52103#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {52158#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {52158#(= main_~p~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,864 INFO L272 TraceCheckUtils]: 26: Hoare triple {52158#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,865 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {52083#true} {52158#(= main_~p~0 2)} #78#return; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,865 INFO L272 TraceCheckUtils]: 31: Hoare triple {52158#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,865 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {52083#true} {52158#(= main_~p~0 2)} #80#return; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,866 INFO L272 TraceCheckUtils]: 36: Hoare triple {52158#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,866 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {52083#true} {52158#(= main_~p~0 2)} #82#return; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {52158#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {52213#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {52213#(= main_~p~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,867 INFO L272 TraceCheckUtils]: 44: Hoare triple {52213#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,868 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {52083#true} {52213#(= main_~p~0 4)} #78#return; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,868 INFO L272 TraceCheckUtils]: 49: Hoare triple {52213#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,868 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {52083#true} {52213#(= main_~p~0 4)} #80#return; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,868 INFO L272 TraceCheckUtils]: 54: Hoare triple {52213#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,869 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {52083#true} {52213#(= main_~p~0 4)} #82#return; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {52213#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {52213#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {52213#(= main_~p~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,870 INFO L272 TraceCheckUtils]: 62: Hoare triple {52213#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,871 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {52083#true} {52213#(= main_~p~0 4)} #84#return; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,871 INFO L272 TraceCheckUtils]: 67: Hoare triple {52213#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,871 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52083#true} {52213#(= main_~p~0 4)} #86#return; {52213#(= main_~p~0 4)} is VALID [2022-04-08 13:26:35,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {52213#(= 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); {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {52158#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {52158#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {52158#(= main_~p~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,873 INFO L272 TraceCheckUtils]: 76: Hoare triple {52158#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,873 INFO L290 TraceCheckUtils]: 78: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,873 INFO L290 TraceCheckUtils]: 79: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,874 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {52083#true} {52158#(= main_~p~0 2)} #84#return; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,874 INFO L272 TraceCheckUtils]: 81: Hoare triple {52158#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,874 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {52083#true} {52158#(= main_~p~0 2)} #86#return; {52158#(= main_~p~0 2)} is VALID [2022-04-08 13:26:35,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {52158#(= main_~p~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); {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,875 INFO L290 TraceCheckUtils]: 87: Hoare triple {52103#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,875 INFO L290 TraceCheckUtils]: 88: Hoare triple {52103#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {52103#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,876 INFO L272 TraceCheckUtils]: 90: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L290 TraceCheckUtils]: 91: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L290 TraceCheckUtils]: 92: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L290 TraceCheckUtils]: 93: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #84#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,876 INFO L272 TraceCheckUtils]: 95: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:35,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:35,877 INFO L290 TraceCheckUtils]: 98: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:35,877 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #86#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:35,877 INFO L290 TraceCheckUtils]: 100: Hoare triple {52103#(= main_~p~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); {52084#false} is VALID [2022-04-08 13:26:35,877 INFO L290 TraceCheckUtils]: 101: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,877 INFO L290 TraceCheckUtils]: 102: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,877 INFO L290 TraceCheckUtils]: 103: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L272 TraceCheckUtils]: 104: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 105: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 106: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 107: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {52084#false} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L272 TraceCheckUtils]: 109: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 110: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 111: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 112: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {52084#false} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 114: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 115: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 116: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L290 TraceCheckUtils]: 117: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,878 INFO L272 TraceCheckUtils]: 118: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 119: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 120: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 121: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {52084#false} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L272 TraceCheckUtils]: 123: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 124: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 125: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 126: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {52084#false} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 128: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 129: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 130: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 131: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L272 TraceCheckUtils]: 132: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,879 INFO L290 TraceCheckUtils]: 133: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 134: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 135: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {52084#false} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L272 TraceCheckUtils]: 137: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 138: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 139: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 140: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {52084#false} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 142: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 143: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 144: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 145: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L272 TraceCheckUtils]: 146: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 147: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,880 INFO L290 TraceCheckUtils]: 148: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 149: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {52084#false} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L272 TraceCheckUtils]: 151: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 152: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 153: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 154: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {52084#false} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 156: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 157: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 158: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 159: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L272 TraceCheckUtils]: 160: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 161: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,881 INFO L290 TraceCheckUtils]: 162: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 163: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {52084#false} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L272 TraceCheckUtils]: 165: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 166: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 167: Hoare triple {52084#false} assume !(0 == ~cond); {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 168: Hoare triple {52084#false} assume true; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {52084#false} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 170: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 171: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 172: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 173: Hoare triple {52084#false} assume !(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L272 TraceCheckUtils]: 174: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 175: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 176: Hoare triple {52084#false} assume 0 == ~cond; {52084#false} is VALID [2022-04-08 13:26:35,882 INFO L290 TraceCheckUtils]: 177: Hoare triple {52084#false} assume !false; {52084#false} is VALID [2022-04-08 13:26:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 723 proven. 34 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-04-08 13:26:35,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 177: Hoare triple {52084#false} assume !false; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 176: Hoare triple {52084#false} assume 0 == ~cond; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 175: Hoare triple {52084#false} ~cond := #in~cond; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L272 TraceCheckUtils]: 174: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 173: Hoare triple {52084#false} assume !(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 172: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 171: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 170: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {52083#true} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 168: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 167: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,680 INFO L290 TraceCheckUtils]: 166: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L272 TraceCheckUtils]: 165: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {52083#true} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 163: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 162: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 161: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L272 TraceCheckUtils]: 160: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 159: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 158: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 157: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 156: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {52083#true} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 154: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 153: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L290 TraceCheckUtils]: 152: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,681 INFO L272 TraceCheckUtils]: 151: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {52083#true} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 149: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 148: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 147: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L272 TraceCheckUtils]: 146: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 145: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 144: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 143: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 142: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {52083#true} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 140: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 139: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L290 TraceCheckUtils]: 138: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L272 TraceCheckUtils]: 137: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,682 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {52083#true} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 135: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 134: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L272 TraceCheckUtils]: 132: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 131: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 130: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 129: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 128: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {52083#true} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 126: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 125: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 124: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L272 TraceCheckUtils]: 123: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,683 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {52083#true} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:36,683 INFO L290 TraceCheckUtils]: 121: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 120: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 119: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L272 TraceCheckUtils]: 118: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 117: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 116: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 115: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 114: Hoare triple {52084#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); {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {52083#true} {52084#false} #86#return; {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 112: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 111: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 110: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L272 TraceCheckUtils]: 109: Hoare triple {52084#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,684 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {52083#true} {52084#false} #84#return; {52084#false} is VALID [2022-04-08 13:26:36,684 INFO L290 TraceCheckUtils]: 107: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 106: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 105: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,685 INFO L272 TraceCheckUtils]: 104: Hoare triple {52084#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 103: Hoare triple {52084#false} assume !!(#t~post6 < 20);havoc #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 102: Hoare triple {52084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52084#false} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 101: Hoare triple {52084#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52084#false} is VALID [2022-04-08 13:26:36,685 INFO L290 TraceCheckUtils]: 100: Hoare triple {52103#(= main_~p~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); {52084#false} is VALID [2022-04-08 13:26:36,686 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #86#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,686 INFO L290 TraceCheckUtils]: 98: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,686 INFO L290 TraceCheckUtils]: 97: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,686 INFO L290 TraceCheckUtils]: 96: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,686 INFO L272 TraceCheckUtils]: 95: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,686 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #84#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,686 INFO L290 TraceCheckUtils]: 93: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,687 INFO L290 TraceCheckUtils]: 92: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,687 INFO L290 TraceCheckUtils]: 91: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,687 INFO L272 TraceCheckUtils]: 90: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,687 INFO L290 TraceCheckUtils]: 89: Hoare triple {52103#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,687 INFO L290 TraceCheckUtils]: 88: Hoare triple {52103#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,687 INFO L290 TraceCheckUtils]: 87: Hoare triple {52103#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,688 INFO L290 TraceCheckUtils]: 86: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~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); {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,689 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {52083#true} {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #86#return; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,689 INFO L290 TraceCheckUtils]: 82: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,689 INFO L272 TraceCheckUtils]: 81: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,690 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {52083#true} {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #84#return; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,690 INFO L290 TraceCheckUtils]: 79: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,690 INFO L272 TraceCheckUtils]: 76: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,690 INFO L290 TraceCheckUtils]: 75: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div 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); {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,693 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52083#true} {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #86#return; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,693 INFO L272 TraceCheckUtils]: 67: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,694 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {52083#true} {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #84#return; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,694 INFO L272 TraceCheckUtils]: 62: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} assume !!(#t~post6 < 20);havoc #t~post6; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} assume !(~r~0 >= ~d~0); {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,696 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {52083#true} {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #82#return; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,696 INFO L272 TraceCheckUtils]: 54: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,696 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {52083#true} {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #80#return; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L272 TraceCheckUtils]: 49: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {52083#true} {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #78#return; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,697 INFO L272 TraceCheckUtils]: 44: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52938#(or (= (div main_~p~0 2) 1) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))))} is VALID [2022-04-08 13:26:36,700 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {52083#true} {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #82#return; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,700 INFO L272 TraceCheckUtils]: 36: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,700 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {52083#true} {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #80#return; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L272 TraceCheckUtils]: 31: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {52083#true} {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #78#return; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,701 INFO L272 TraceCheckUtils]: 26: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {52103#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52895#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-08 13:26:36,703 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #82#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,703 INFO L272 TraceCheckUtils]: 18: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,703 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #80#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {52083#true} {52103#(= main_~p~0 1)} #78#return; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {52083#true} assume !(0 == ~cond); {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {52083#true} ~cond := #in~cond; {52083#true} is VALID [2022-04-08 13:26:36,704 INFO L272 TraceCheckUtils]: 8: Hoare triple {52103#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52083#true} is VALID [2022-04-08 13:26:36,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {52103#(= main_~p~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {52103#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {52083#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; {52103#(= main_~p~0 1)} is VALID [2022-04-08 13:26:36,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {52083#true} call #t~ret7 := main(); {52083#true} is VALID [2022-04-08 13:26:36,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52083#true} {52083#true} #92#return; {52083#true} is VALID [2022-04-08 13:26:36,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {52083#true} assume true; {52083#true} is VALID [2022-04-08 13:26:36,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {52083#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; {52083#true} is VALID [2022-04-08 13:26:36,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {52083#true} call ULTIMATE.init(); {52083#true} is VALID [2022-04-08 13:26:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 149 proven. 28 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2022-04-08 13:26:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:36,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281965750] [2022-04-08 13:26:36,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:36,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276919124] [2022-04-08 13:26:36,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276919124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:26:36,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:26:36,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-08 13:26:36,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:36,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378822816] [2022-04-08 13:26:36,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378822816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:36,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:36,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:26:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061252735] [2022-04-08 13:26:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 178 [2022-04-08 13:26:36,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:36,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 13:26:36,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:36,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:26:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:26:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:26:36,776 INFO L87 Difference]: Start difference. First operand 661 states and 740 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 13:26:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:37,860 INFO L93 Difference]: Finished difference Result 717 states and 805 transitions. [2022-04-08 13:26:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:26:37,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 178 [2022-04-08 13:26:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 13:26:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-08 13:26:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 13:26:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-08 13:26:37,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-04-08 13:26:37,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:37,959 INFO L225 Difference]: With dead ends: 717 [2022-04-08 13:26:37,959 INFO L226 Difference]: Without dead ends: 563 [2022-04-08 13:26:37,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:26:37,960 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:37,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:26:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-08 13:26:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-08 13:26:38,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:38,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-08 13:26:38,822 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-08 13:26:38,823 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-08 13:26:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:38,832 INFO L93 Difference]: Finished difference Result 563 states and 627 transitions. [2022-04-08 13:26:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-08 13:26:38,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:38,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:38,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 563 states. [2022-04-08 13:26:38,834 INFO L87 Difference]: Start difference. First operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 563 states. [2022-04-08 13:26:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:38,843 INFO L93 Difference]: Finished difference Result 563 states and 627 transitions. [2022-04-08 13:26:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-08 13:26:38,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:38,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:38,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:38,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-08 13:26:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 627 transitions. [2022-04-08 13:26:38,858 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 627 transitions. Word has length 178 [2022-04-08 13:26:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:38,858 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 627 transitions. [2022-04-08 13:26:38,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-08 13:26:38,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 563 states and 627 transitions. [2022-04-08 13:26:39,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-08 13:26:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-08 13:26:39,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:39,863 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:26:39,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:40,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:40,080 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 5 times [2022-04-08 13:26:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:40,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163226742] [2022-04-08 13:26:44,169 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:44,169 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 6 times [2022-04-08 13:26:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:44,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198513437] [2022-04-08 13:26:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:44,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179367353] [2022-04-08 13:26:44,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:26:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:44,193 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:44,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 13:26:44,250 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 13:26:44,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:44,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 13:26:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:44,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:44,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {56843#true} call ULTIMATE.init(); {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {56843#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; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56843#true} {56843#true} #92#return; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {56843#true} call #t~ret7 := main(); {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {56843#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; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L272 TraceCheckUtils]: 8: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L272 TraceCheckUtils]: 18: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,599 INFO L272 TraceCheckUtils]: 26: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L272 TraceCheckUtils]: 31: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L272 TraceCheckUtils]: 36: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L272 TraceCheckUtils]: 44: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L272 TraceCheckUtils]: 49: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L272 TraceCheckUtils]: 54: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L272 TraceCheckUtils]: 62: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L272 TraceCheckUtils]: 67: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,602 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L272 TraceCheckUtils]: 72: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L272 TraceCheckUtils]: 80: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L272 TraceCheckUtils]: 85: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 87: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 88: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L272 TraceCheckUtils]: 90: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 91: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 92: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 95: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L272 TraceCheckUtils]: 98: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 99: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 100: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L272 TraceCheckUtils]: 103: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 105: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 106: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L272 TraceCheckUtils]: 108: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 109: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 113: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 114: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L290 TraceCheckUtils]: 115: Hoare triple {56843#true} assume !!(#t~post5 < 20);havoc #t~post5; {56843#true} is VALID [2022-04-08 13:26:44,605 INFO L272 TraceCheckUtils]: 116: Hoare triple {56843#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 117: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 118: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 119: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {56843#true} {56843#true} #78#return; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L272 TraceCheckUtils]: 121: Hoare triple {56843#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 122: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 123: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 124: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {56843#true} {56843#true} #80#return; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L272 TraceCheckUtils]: 126: Hoare triple {56843#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 127: Hoare triple {56843#true} ~cond := #in~cond; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 128: Hoare triple {56843#true} assume !(0 == ~cond); {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 129: Hoare triple {56843#true} assume true; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {56843#true} {56843#true} #82#return; {56843#true} is VALID [2022-04-08 13:26:44,606 INFO L290 TraceCheckUtils]: 131: Hoare triple {56843#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56843#true} is VALID [2022-04-08 13:26:44,607 INFO L290 TraceCheckUtils]: 132: Hoare triple {56843#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {57244#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-08 13:26:44,608 INFO L290 TraceCheckUtils]: 133: Hoare triple {57244#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 20);havoc #t~post5; {57248#(<= 21 ~counter~0)} is VALID [2022-04-08 13:26:44,608 INFO L290 TraceCheckUtils]: 134: Hoare triple {57248#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57252#(<= 21 |main_#t~post6|)} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 135: Hoare triple {57252#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L272 TraceCheckUtils]: 136: Hoare triple {56844#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 137: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 138: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 139: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {56844#false} {56844#false} #84#return; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L272 TraceCheckUtils]: 141: Hoare triple {56844#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 142: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 143: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 144: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {56844#false} {56844#false} #86#return; {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 146: Hoare triple {56844#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); {56844#false} is VALID [2022-04-08 13:26:44,609 INFO L290 TraceCheckUtils]: 147: Hoare triple {56844#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 148: Hoare triple {56844#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 149: Hoare triple {56844#false} assume !!(#t~post6 < 20);havoc #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L272 TraceCheckUtils]: 150: Hoare triple {56844#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 151: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 152: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 153: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {56844#false} {56844#false} #84#return; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L272 TraceCheckUtils]: 155: Hoare triple {56844#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 156: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 157: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 158: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56844#false} {56844#false} #86#return; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 160: Hoare triple {56844#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); {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 161: Hoare triple {56844#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56844#false} is VALID [2022-04-08 13:26:44,610 INFO L290 TraceCheckUtils]: 162: Hoare triple {56844#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 163: Hoare triple {56844#false} assume !!(#t~post6 < 20);havoc #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L272 TraceCheckUtils]: 164: Hoare triple {56844#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 165: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 166: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 167: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {56844#false} {56844#false} #84#return; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L272 TraceCheckUtils]: 169: Hoare triple {56844#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 170: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 171: Hoare triple {56844#false} assume !(0 == ~cond); {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 172: Hoare triple {56844#false} assume true; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {56844#false} {56844#false} #86#return; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 174: Hoare triple {56844#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); {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 175: Hoare triple {56844#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 176: Hoare triple {56844#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,611 INFO L290 TraceCheckUtils]: 177: Hoare triple {56844#false} assume !(#t~post6 < 20);havoc #t~post6; {56844#false} is VALID [2022-04-08 13:26:44,612 INFO L272 TraceCheckUtils]: 178: Hoare triple {56844#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {56844#false} is VALID [2022-04-08 13:26:44,612 INFO L290 TraceCheckUtils]: 179: Hoare triple {56844#false} ~cond := #in~cond; {56844#false} is VALID [2022-04-08 13:26:44,612 INFO L290 TraceCheckUtils]: 180: Hoare triple {56844#false} assume 0 == ~cond; {56844#false} is VALID [2022-04-08 13:26:44,612 INFO L290 TraceCheckUtils]: 181: Hoare triple {56844#false} assume !false; {56844#false} is VALID [2022-04-08 13:26:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2022-04-08 13:26:44,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:26:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198513437] [2022-04-08 13:26:44,613 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179367353] [2022-04-08 13:26:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179367353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:26:44,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163226742] [2022-04-08 13:26:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163226742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:26:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84182302] [2022-04-08 13:26:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 182 [2022-04-08 13:26:44,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:44,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 13:26:44,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:44,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:26:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:26:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:26:44,641 INFO L87 Difference]: Start difference. First operand 563 states and 627 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 13:26:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:45,502 INFO L93 Difference]: Finished difference Result 650 states and 714 transitions. [2022-04-08 13:26:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:26:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 182 [2022-04-08 13:26:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 13:26:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 13:26:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 13:26:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 13:26:45,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 13:26:45,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:45,563 INFO L225 Difference]: With dead ends: 650 [2022-04-08 13:26:45,563 INFO L226 Difference]: Without dead ends: 537 [2022-04-08 13:26:45,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:26:45,564 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:45,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:26:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-08 13:26:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2022-04-08 13:26:46,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:46,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 13:26:46,275 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 13:26:46,275 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 13:26:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:46,284 INFO L93 Difference]: Finished difference Result 537 states and 584 transitions. [2022-04-08 13:26:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 584 transitions. [2022-04-08 13:26:46,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:46,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:46,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 537 states. [2022-04-08 13:26:46,285 INFO L87 Difference]: Start difference. First operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 537 states. [2022-04-08 13:26:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:46,294 INFO L93 Difference]: Finished difference Result 537 states and 584 transitions. [2022-04-08 13:26:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 584 transitions. [2022-04-08 13:26:46,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:46,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:46,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:46,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 13:26:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 583 transitions. [2022-04-08 13:26:46,308 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 583 transitions. Word has length 182 [2022-04-08 13:26:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:46,308 INFO L478 AbstractCegarLoop]: Abstraction has 535 states and 583 transitions. [2022-04-08 13:26:46,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 13:26:46,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 535 states and 583 transitions. [2022-04-08 13:26:47,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 583 transitions. [2022-04-08 13:26:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-08 13:26:47,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:47,532 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:26:47,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:47,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:47,733 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 19 times [2022-04-08 13:26:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:47,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430174963] [2022-04-08 13:26:51,802 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:51,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 20 times [2022-04-08 13:26:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:51,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488992119] [2022-04-08 13:26:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:51,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:51,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85323344] [2022-04-08 13:26:51,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:26:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:51,840 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:51,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 13:26:51,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:26:51,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:51,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 13:26:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:51,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:52,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {60839#true} call ULTIMATE.init(); {60839#true} is VALID [2022-04-08 13:26:52,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {60839#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; {60847#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:52,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {60847#(<= ~counter~0 0)} assume true; {60847#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:52,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60847#(<= ~counter~0 0)} {60839#true} #92#return; {60847#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:52,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {60847#(<= ~counter~0 0)} call #t~ret7 := main(); {60847#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:52,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {60847#(<= ~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; {60847#(<= ~counter~0 0)} is VALID [2022-04-08 13:26:52,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {60847#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {60863#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,696 INFO L272 TraceCheckUtils]: 8: Hoare triple {60863#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {60863#(<= ~counter~0 1)} ~cond := #in~cond; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {60863#(<= ~counter~0 1)} assume !(0 == ~cond); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {60863#(<= ~counter~0 1)} assume true; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,698 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60863#(<= ~counter~0 1)} {60863#(<= ~counter~0 1)} #78#return; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,698 INFO L272 TraceCheckUtils]: 13: Hoare triple {60863#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {60863#(<= ~counter~0 1)} ~cond := #in~cond; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {60863#(<= ~counter~0 1)} assume !(0 == ~cond); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {60863#(<= ~counter~0 1)} assume true; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,699 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {60863#(<= ~counter~0 1)} {60863#(<= ~counter~0 1)} #80#return; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,700 INFO L272 TraceCheckUtils]: 18: Hoare triple {60863#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {60863#(<= ~counter~0 1)} ~cond := #in~cond; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {60863#(<= ~counter~0 1)} assume !(0 == ~cond); {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {60863#(<= ~counter~0 1)} assume true; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,701 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60863#(<= ~counter~0 1)} {60863#(<= ~counter~0 1)} #82#return; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {60863#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60863#(<= ~counter~0 1)} is VALID [2022-04-08 13:26:52,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {60863#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {60918#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,702 INFO L272 TraceCheckUtils]: 26: Hoare triple {60918#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {60918#(<= ~counter~0 2)} ~cond := #in~cond; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {60918#(<= ~counter~0 2)} assume !(0 == ~cond); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {60918#(<= ~counter~0 2)} assume true; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,704 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60918#(<= ~counter~0 2)} {60918#(<= ~counter~0 2)} #78#return; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,704 INFO L272 TraceCheckUtils]: 31: Hoare triple {60918#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {60918#(<= ~counter~0 2)} ~cond := #in~cond; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {60918#(<= ~counter~0 2)} assume !(0 == ~cond); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {60918#(<= ~counter~0 2)} assume true; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,705 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {60918#(<= ~counter~0 2)} {60918#(<= ~counter~0 2)} #80#return; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,706 INFO L272 TraceCheckUtils]: 36: Hoare triple {60918#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {60918#(<= ~counter~0 2)} ~cond := #in~cond; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {60918#(<= ~counter~0 2)} assume !(0 == ~cond); {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {60918#(<= ~counter~0 2)} assume true; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,707 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60918#(<= ~counter~0 2)} {60918#(<= ~counter~0 2)} #82#return; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {60918#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60918#(<= ~counter~0 2)} is VALID [2022-04-08 13:26:52,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {60918#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {60973#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,708 INFO L272 TraceCheckUtils]: 44: Hoare triple {60973#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {60973#(<= ~counter~0 3)} ~cond := #in~cond; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {60973#(<= ~counter~0 3)} assume !(0 == ~cond); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {60973#(<= ~counter~0 3)} assume true; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,709 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {60973#(<= ~counter~0 3)} {60973#(<= ~counter~0 3)} #78#return; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,710 INFO L272 TraceCheckUtils]: 49: Hoare triple {60973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {60973#(<= ~counter~0 3)} ~cond := #in~cond; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {60973#(<= ~counter~0 3)} assume !(0 == ~cond); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {60973#(<= ~counter~0 3)} assume true; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,711 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {60973#(<= ~counter~0 3)} {60973#(<= ~counter~0 3)} #80#return; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,711 INFO L272 TraceCheckUtils]: 54: Hoare triple {60973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {60973#(<= ~counter~0 3)} ~cond := #in~cond; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {60973#(<= ~counter~0 3)} assume !(0 == ~cond); {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {60973#(<= ~counter~0 3)} assume true; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,713 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {60973#(<= ~counter~0 3)} {60973#(<= ~counter~0 3)} #82#return; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {60973#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60973#(<= ~counter~0 3)} is VALID [2022-04-08 13:26:52,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {60973#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,714 INFO L290 TraceCheckUtils]: 61: Hoare triple {61028#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,714 INFO L272 TraceCheckUtils]: 62: Hoare triple {61028#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {61028#(<= ~counter~0 4)} ~cond := #in~cond; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {61028#(<= ~counter~0 4)} assume !(0 == ~cond); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {61028#(<= ~counter~0 4)} assume true; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,715 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {61028#(<= ~counter~0 4)} {61028#(<= ~counter~0 4)} #78#return; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,716 INFO L272 TraceCheckUtils]: 67: Hoare triple {61028#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {61028#(<= ~counter~0 4)} ~cond := #in~cond; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {61028#(<= ~counter~0 4)} assume !(0 == ~cond); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {61028#(<= ~counter~0 4)} assume true; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,717 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {61028#(<= ~counter~0 4)} {61028#(<= ~counter~0 4)} #80#return; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,717 INFO L272 TraceCheckUtils]: 72: Hoare triple {61028#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {61028#(<= ~counter~0 4)} ~cond := #in~cond; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {61028#(<= ~counter~0 4)} assume !(0 == ~cond); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,718 INFO L290 TraceCheckUtils]: 75: Hoare triple {61028#(<= ~counter~0 4)} assume true; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,719 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {61028#(<= ~counter~0 4)} {61028#(<= ~counter~0 4)} #82#return; {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {61028#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {61028#(<= ~counter~0 4)} is VALID [2022-04-08 13:26:52,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {61028#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {61083#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,720 INFO L272 TraceCheckUtils]: 80: Hoare triple {61083#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {61083#(<= ~counter~0 5)} ~cond := #in~cond; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {61083#(<= ~counter~0 5)} assume !(0 == ~cond); {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {61083#(<= ~counter~0 5)} assume true; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,721 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {61083#(<= ~counter~0 5)} {61083#(<= ~counter~0 5)} #84#return; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,722 INFO L272 TraceCheckUtils]: 85: Hoare triple {61083#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {61083#(<= ~counter~0 5)} ~cond := #in~cond; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {61083#(<= ~counter~0 5)} assume !(0 == ~cond); {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,723 INFO L290 TraceCheckUtils]: 88: Hoare triple {61083#(<= ~counter~0 5)} assume true; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,723 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {61083#(<= ~counter~0 5)} {61083#(<= ~counter~0 5)} #86#return; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {61083#(<= ~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); {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,724 INFO L290 TraceCheckUtils]: 91: Hoare triple {61083#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61083#(<= ~counter~0 5)} is VALID [2022-04-08 13:26:52,724 INFO L290 TraceCheckUtils]: 92: Hoare triple {61083#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,725 INFO L290 TraceCheckUtils]: 93: Hoare triple {61126#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,725 INFO L272 TraceCheckUtils]: 94: Hoare triple {61126#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,725 INFO L290 TraceCheckUtils]: 95: Hoare triple {61126#(<= ~counter~0 6)} ~cond := #in~cond; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {61126#(<= ~counter~0 6)} assume !(0 == ~cond); {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,726 INFO L290 TraceCheckUtils]: 97: Hoare triple {61126#(<= ~counter~0 6)} assume true; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,726 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {61126#(<= ~counter~0 6)} {61126#(<= ~counter~0 6)} #84#return; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,727 INFO L272 TraceCheckUtils]: 99: Hoare triple {61126#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {61126#(<= ~counter~0 6)} ~cond := #in~cond; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,727 INFO L290 TraceCheckUtils]: 101: Hoare triple {61126#(<= ~counter~0 6)} assume !(0 == ~cond); {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,727 INFO L290 TraceCheckUtils]: 102: Hoare triple {61126#(<= ~counter~0 6)} assume true; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,728 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {61126#(<= ~counter~0 6)} {61126#(<= ~counter~0 6)} #86#return; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,728 INFO L290 TraceCheckUtils]: 104: Hoare triple {61126#(<= ~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); {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,728 INFO L290 TraceCheckUtils]: 105: Hoare triple {61126#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61126#(<= ~counter~0 6)} is VALID [2022-04-08 13:26:52,729 INFO L290 TraceCheckUtils]: 106: Hoare triple {61126#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,729 INFO L290 TraceCheckUtils]: 107: Hoare triple {61169#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,730 INFO L272 TraceCheckUtils]: 108: Hoare triple {61169#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,730 INFO L290 TraceCheckUtils]: 109: Hoare triple {61169#(<= ~counter~0 7)} ~cond := #in~cond; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,730 INFO L290 TraceCheckUtils]: 110: Hoare triple {61169#(<= ~counter~0 7)} assume !(0 == ~cond); {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,731 INFO L290 TraceCheckUtils]: 111: Hoare triple {61169#(<= ~counter~0 7)} assume true; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,731 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {61169#(<= ~counter~0 7)} {61169#(<= ~counter~0 7)} #84#return; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,732 INFO L272 TraceCheckUtils]: 113: Hoare triple {61169#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {61169#(<= ~counter~0 7)} ~cond := #in~cond; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {61169#(<= ~counter~0 7)} assume !(0 == ~cond); {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,732 INFO L290 TraceCheckUtils]: 116: Hoare triple {61169#(<= ~counter~0 7)} assume true; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,733 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {61169#(<= ~counter~0 7)} {61169#(<= ~counter~0 7)} #86#return; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {61169#(<= ~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); {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,733 INFO L290 TraceCheckUtils]: 119: Hoare triple {61169#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61169#(<= ~counter~0 7)} is VALID [2022-04-08 13:26:52,734 INFO L290 TraceCheckUtils]: 120: Hoare triple {61169#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,735 INFO L290 TraceCheckUtils]: 121: Hoare triple {61212#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,735 INFO L272 TraceCheckUtils]: 122: Hoare triple {61212#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,735 INFO L290 TraceCheckUtils]: 123: Hoare triple {61212#(<= ~counter~0 8)} ~cond := #in~cond; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,736 INFO L290 TraceCheckUtils]: 124: Hoare triple {61212#(<= ~counter~0 8)} assume !(0 == ~cond); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,736 INFO L290 TraceCheckUtils]: 125: Hoare triple {61212#(<= ~counter~0 8)} assume true; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,736 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {61212#(<= ~counter~0 8)} {61212#(<= ~counter~0 8)} #84#return; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,737 INFO L272 TraceCheckUtils]: 127: Hoare triple {61212#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {61212#(<= ~counter~0 8)} ~cond := #in~cond; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {61212#(<= ~counter~0 8)} assume !(0 == ~cond); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {61212#(<= ~counter~0 8)} assume true; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,738 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {61212#(<= ~counter~0 8)} {61212#(<= ~counter~0 8)} #86#return; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,738 INFO L290 TraceCheckUtils]: 132: Hoare triple {61212#(<= ~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); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,739 INFO L290 TraceCheckUtils]: 133: Hoare triple {61212#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:52,739 INFO L290 TraceCheckUtils]: 134: Hoare triple {61212#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,740 INFO L290 TraceCheckUtils]: 135: Hoare triple {61255#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,740 INFO L272 TraceCheckUtils]: 136: Hoare triple {61255#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,740 INFO L290 TraceCheckUtils]: 137: Hoare triple {61255#(<= ~counter~0 9)} ~cond := #in~cond; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,741 INFO L290 TraceCheckUtils]: 138: Hoare triple {61255#(<= ~counter~0 9)} assume !(0 == ~cond); {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,741 INFO L290 TraceCheckUtils]: 139: Hoare triple {61255#(<= ~counter~0 9)} assume true; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,741 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {61255#(<= ~counter~0 9)} {61255#(<= ~counter~0 9)} #84#return; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,742 INFO L272 TraceCheckUtils]: 141: Hoare triple {61255#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,742 INFO L290 TraceCheckUtils]: 142: Hoare triple {61255#(<= ~counter~0 9)} ~cond := #in~cond; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,742 INFO L290 TraceCheckUtils]: 143: Hoare triple {61255#(<= ~counter~0 9)} assume !(0 == ~cond); {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,743 INFO L290 TraceCheckUtils]: 144: Hoare triple {61255#(<= ~counter~0 9)} assume true; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,743 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {61255#(<= ~counter~0 9)} {61255#(<= ~counter~0 9)} #86#return; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,743 INFO L290 TraceCheckUtils]: 146: Hoare triple {61255#(<= ~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); {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,744 INFO L290 TraceCheckUtils]: 147: Hoare triple {61255#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:52,744 INFO L290 TraceCheckUtils]: 148: Hoare triple {61255#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,745 INFO L290 TraceCheckUtils]: 149: Hoare triple {61298#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,745 INFO L272 TraceCheckUtils]: 150: Hoare triple {61298#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,745 INFO L290 TraceCheckUtils]: 151: Hoare triple {61298#(<= ~counter~0 10)} ~cond := #in~cond; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,746 INFO L290 TraceCheckUtils]: 152: Hoare triple {61298#(<= ~counter~0 10)} assume !(0 == ~cond); {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,746 INFO L290 TraceCheckUtils]: 153: Hoare triple {61298#(<= ~counter~0 10)} assume true; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,747 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {61298#(<= ~counter~0 10)} {61298#(<= ~counter~0 10)} #84#return; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,747 INFO L272 TraceCheckUtils]: 155: Hoare triple {61298#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,747 INFO L290 TraceCheckUtils]: 156: Hoare triple {61298#(<= ~counter~0 10)} ~cond := #in~cond; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,747 INFO L290 TraceCheckUtils]: 157: Hoare triple {61298#(<= ~counter~0 10)} assume !(0 == ~cond); {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,748 INFO L290 TraceCheckUtils]: 158: Hoare triple {61298#(<= ~counter~0 10)} assume true; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,748 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {61298#(<= ~counter~0 10)} {61298#(<= ~counter~0 10)} #86#return; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,749 INFO L290 TraceCheckUtils]: 160: Hoare triple {61298#(<= ~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); {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,749 INFO L290 TraceCheckUtils]: 161: Hoare triple {61298#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:52,749 INFO L290 TraceCheckUtils]: 162: Hoare triple {61298#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,750 INFO L290 TraceCheckUtils]: 163: Hoare triple {61341#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,750 INFO L272 TraceCheckUtils]: 164: Hoare triple {61341#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,750 INFO L290 TraceCheckUtils]: 165: Hoare triple {61341#(<= ~counter~0 11)} ~cond := #in~cond; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,751 INFO L290 TraceCheckUtils]: 166: Hoare triple {61341#(<= ~counter~0 11)} assume !(0 == ~cond); {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,751 INFO L290 TraceCheckUtils]: 167: Hoare triple {61341#(<= ~counter~0 11)} assume true; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,751 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {61341#(<= ~counter~0 11)} {61341#(<= ~counter~0 11)} #84#return; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,752 INFO L272 TraceCheckUtils]: 169: Hoare triple {61341#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,752 INFO L290 TraceCheckUtils]: 170: Hoare triple {61341#(<= ~counter~0 11)} ~cond := #in~cond; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,753 INFO L290 TraceCheckUtils]: 171: Hoare triple {61341#(<= ~counter~0 11)} assume !(0 == ~cond); {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,753 INFO L290 TraceCheckUtils]: 172: Hoare triple {61341#(<= ~counter~0 11)} assume true; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,753 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {61341#(<= ~counter~0 11)} {61341#(<= ~counter~0 11)} #86#return; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,753 INFO L290 TraceCheckUtils]: 174: Hoare triple {61341#(<= ~counter~0 11)} 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); {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,754 INFO L290 TraceCheckUtils]: 175: Hoare triple {61341#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:52,754 INFO L290 TraceCheckUtils]: 176: Hoare triple {61341#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61384#(<= |main_#t~post6| 11)} is VALID [2022-04-08 13:26:52,754 INFO L290 TraceCheckUtils]: 177: Hoare triple {61384#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {60840#false} is VALID [2022-04-08 13:26:52,755 INFO L272 TraceCheckUtils]: 178: Hoare triple {60840#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {60840#false} is VALID [2022-04-08 13:26:52,755 INFO L290 TraceCheckUtils]: 179: Hoare triple {60840#false} ~cond := #in~cond; {60840#false} is VALID [2022-04-08 13:26:52,755 INFO L290 TraceCheckUtils]: 180: Hoare triple {60840#false} assume 0 == ~cond; {60840#false} is VALID [2022-04-08 13:26:52,755 INFO L290 TraceCheckUtils]: 181: Hoare triple {60840#false} assume !false; {60840#false} is VALID [2022-04-08 13:26:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 52 proven. 1400 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-04-08 13:26:52,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:26:53,501 INFO L290 TraceCheckUtils]: 181: Hoare triple {60840#false} assume !false; {60840#false} is VALID [2022-04-08 13:26:53,501 INFO L290 TraceCheckUtils]: 180: Hoare triple {60840#false} assume 0 == ~cond; {60840#false} is VALID [2022-04-08 13:26:53,501 INFO L290 TraceCheckUtils]: 179: Hoare triple {60840#false} ~cond := #in~cond; {60840#false} is VALID [2022-04-08 13:26:53,501 INFO L272 TraceCheckUtils]: 178: Hoare triple {60840#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {60840#false} is VALID [2022-04-08 13:26:53,501 INFO L290 TraceCheckUtils]: 177: Hoare triple {61412#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {60840#false} is VALID [2022-04-08 13:26:53,501 INFO L290 TraceCheckUtils]: 176: Hoare triple {61416#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61412#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:26:53,502 INFO L290 TraceCheckUtils]: 175: Hoare triple {61416#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,502 INFO L290 TraceCheckUtils]: 174: Hoare triple {61416#(< ~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); {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,502 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {60839#true} {61416#(< ~counter~0 20)} #86#return; {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,502 INFO L290 TraceCheckUtils]: 172: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L290 TraceCheckUtils]: 171: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L290 TraceCheckUtils]: 170: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L272 TraceCheckUtils]: 169: Hoare triple {61416#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {60839#true} {61416#(< ~counter~0 20)} #84#return; {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,503 INFO L290 TraceCheckUtils]: 167: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L290 TraceCheckUtils]: 166: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L290 TraceCheckUtils]: 165: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,503 INFO L272 TraceCheckUtils]: 164: Hoare triple {61416#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,504 INFO L290 TraceCheckUtils]: 163: Hoare triple {61416#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,505 INFO L290 TraceCheckUtils]: 162: Hoare triple {61459#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61416#(< ~counter~0 20)} is VALID [2022-04-08 13:26:53,505 INFO L290 TraceCheckUtils]: 161: Hoare triple {61459#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,505 INFO L290 TraceCheckUtils]: 160: Hoare triple {61459#(< ~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); {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,506 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {60839#true} {61459#(< ~counter~0 19)} #86#return; {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,506 INFO L290 TraceCheckUtils]: 158: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,506 INFO L290 TraceCheckUtils]: 157: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,506 INFO L290 TraceCheckUtils]: 156: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,506 INFO L272 TraceCheckUtils]: 155: Hoare triple {61459#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,506 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {60839#true} {61459#(< ~counter~0 19)} #84#return; {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,506 INFO L290 TraceCheckUtils]: 153: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,506 INFO L290 TraceCheckUtils]: 152: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,507 INFO L290 TraceCheckUtils]: 151: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,507 INFO L272 TraceCheckUtils]: 150: Hoare triple {61459#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,507 INFO L290 TraceCheckUtils]: 149: Hoare triple {61459#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,507 INFO L290 TraceCheckUtils]: 148: Hoare triple {61502#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61459#(< ~counter~0 19)} is VALID [2022-04-08 13:26:53,508 INFO L290 TraceCheckUtils]: 147: Hoare triple {61502#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,508 INFO L290 TraceCheckUtils]: 146: Hoare triple {61502#(< ~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); {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,508 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {60839#true} {61502#(< ~counter~0 18)} #86#return; {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,508 INFO L290 TraceCheckUtils]: 144: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L290 TraceCheckUtils]: 143: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L290 TraceCheckUtils]: 142: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L272 TraceCheckUtils]: 141: Hoare triple {61502#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {60839#true} {61502#(< ~counter~0 18)} #84#return; {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,509 INFO L290 TraceCheckUtils]: 139: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L290 TraceCheckUtils]: 138: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L290 TraceCheckUtils]: 137: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,509 INFO L272 TraceCheckUtils]: 136: Hoare triple {61502#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,510 INFO L290 TraceCheckUtils]: 135: Hoare triple {61502#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,510 INFO L290 TraceCheckUtils]: 134: Hoare triple {61545#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61502#(< ~counter~0 18)} is VALID [2022-04-08 13:26:53,510 INFO L290 TraceCheckUtils]: 133: Hoare triple {61545#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,511 INFO L290 TraceCheckUtils]: 132: Hoare triple {61545#(< ~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); {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,511 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {60839#true} {61545#(< ~counter~0 17)} #86#return; {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,511 INFO L290 TraceCheckUtils]: 130: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,511 INFO L290 TraceCheckUtils]: 129: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,511 INFO L290 TraceCheckUtils]: 128: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,511 INFO L272 TraceCheckUtils]: 127: Hoare triple {61545#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,512 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {60839#true} {61545#(< ~counter~0 17)} #84#return; {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,512 INFO L290 TraceCheckUtils]: 123: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,512 INFO L272 TraceCheckUtils]: 122: Hoare triple {61545#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {61545#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,513 INFO L290 TraceCheckUtils]: 120: Hoare triple {61588#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61545#(< ~counter~0 17)} is VALID [2022-04-08 13:26:53,513 INFO L290 TraceCheckUtils]: 119: Hoare triple {61588#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,513 INFO L290 TraceCheckUtils]: 118: Hoare triple {61588#(< ~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); {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,514 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {60839#true} {61588#(< ~counter~0 16)} #86#return; {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,514 INFO L290 TraceCheckUtils]: 116: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,514 INFO L290 TraceCheckUtils]: 115: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,514 INFO L290 TraceCheckUtils]: 114: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,514 INFO L272 TraceCheckUtils]: 113: Hoare triple {61588#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,514 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {60839#true} {61588#(< ~counter~0 16)} #84#return; {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,515 INFO L290 TraceCheckUtils]: 111: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,515 INFO L290 TraceCheckUtils]: 110: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,515 INFO L290 TraceCheckUtils]: 109: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,515 INFO L272 TraceCheckUtils]: 108: Hoare triple {61588#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,515 INFO L290 TraceCheckUtils]: 107: Hoare triple {61588#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {61631#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61588#(< ~counter~0 16)} is VALID [2022-04-08 13:26:53,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {61631#(< ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,516 INFO L290 TraceCheckUtils]: 104: Hoare triple {61631#(< ~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); {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,517 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60839#true} {61631#(< ~counter~0 15)} #86#return; {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 102: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 101: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 100: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L272 TraceCheckUtils]: 99: Hoare triple {61631#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {60839#true} {61631#(< ~counter~0 15)} #84#return; {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 96: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L290 TraceCheckUtils]: 95: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,517 INFO L272 TraceCheckUtils]: 94: Hoare triple {61631#(< ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {61631#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {61674#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61631#(< ~counter~0 15)} is VALID [2022-04-08 13:26:53,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {61674#(< ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,519 INFO L290 TraceCheckUtils]: 90: Hoare triple {61674#(< ~counter~0 14)} 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); {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,520 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {60839#true} {61674#(< ~counter~0 14)} #86#return; {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,520 INFO L290 TraceCheckUtils]: 86: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,520 INFO L272 TraceCheckUtils]: 85: Hoare triple {61674#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,520 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {60839#true} {61674#(< ~counter~0 14)} #84#return; {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,521 INFO L272 TraceCheckUtils]: 80: Hoare triple {61674#(< ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {61674#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {61717#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61674#(< ~counter~0 14)} is VALID [2022-04-08 13:26:53,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {61717#(< ~counter~0 13)} assume !(~r~0 >= ~d~0); {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,522 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {60839#true} {61717#(< ~counter~0 13)} #82#return; {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L272 TraceCheckUtils]: 72: Hoare triple {61717#(< ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60839#true} {61717#(< ~counter~0 13)} #80#return; {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,523 INFO L272 TraceCheckUtils]: 67: Hoare triple {61717#(< ~counter~0 13)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,524 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {60839#true} {61717#(< ~counter~0 13)} #78#return; {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,524 INFO L272 TraceCheckUtils]: 62: Hoare triple {61717#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {61717#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {61341#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61717#(< ~counter~0 13)} is VALID [2022-04-08 13:26:53,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {61341#(<= ~counter~0 11)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,526 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {60839#true} {61341#(<= ~counter~0 11)} #82#return; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,526 INFO L272 TraceCheckUtils]: 54: Hoare triple {61341#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,526 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {60839#true} {61341#(<= ~counter~0 11)} #80#return; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L272 TraceCheckUtils]: 49: Hoare triple {61341#(<= ~counter~0 11)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {60839#true} {61341#(<= ~counter~0 11)} #78#return; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,527 INFO L272 TraceCheckUtils]: 44: Hoare triple {61341#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {61341#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {61298#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61341#(<= ~counter~0 11)} is VALID [2022-04-08 13:26:53,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {61298#(<= ~counter~0 10)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,529 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60839#true} {61298#(<= ~counter~0 10)} #82#return; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,529 INFO L272 TraceCheckUtils]: 36: Hoare triple {61298#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {60839#true} {61298#(<= ~counter~0 10)} #80#return; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L272 TraceCheckUtils]: 31: Hoare triple {61298#(<= ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60839#true} {61298#(<= ~counter~0 10)} #78#return; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,530 INFO L272 TraceCheckUtils]: 26: Hoare triple {61298#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {61298#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {61255#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61298#(<= ~counter~0 10)} is VALID [2022-04-08 13:26:53,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {61255#(<= ~counter~0 9)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,532 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60839#true} {61255#(<= ~counter~0 9)} #82#return; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,532 INFO L272 TraceCheckUtils]: 18: Hoare triple {61255#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {60839#true} {61255#(<= ~counter~0 9)} #80#return; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {61255#(<= ~counter~0 9)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,533 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60839#true} {61255#(<= ~counter~0 9)} #78#return; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {60839#true} assume true; {60839#true} is VALID [2022-04-08 13:26:53,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {60839#true} assume !(0 == ~cond); {60839#true} is VALID [2022-04-08 13:26:53,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {60839#true} ~cond := #in~cond; {60839#true} is VALID [2022-04-08 13:26:53,534 INFO L272 TraceCheckUtils]: 8: Hoare triple {61255#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60839#true} is VALID [2022-04-08 13:26:53,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {61255#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {61212#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61255#(<= ~counter~0 9)} is VALID [2022-04-08 13:26:53,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {61212#(<= ~counter~0 8)} 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; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:53,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {61212#(<= ~counter~0 8)} call #t~ret7 := main(); {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:53,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61212#(<= ~counter~0 8)} {60839#true} #92#return; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:53,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {61212#(<= ~counter~0 8)} assume true; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:53,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {60839#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; {61212#(<= ~counter~0 8)} is VALID [2022-04-08 13:26:53,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {60839#true} call ULTIMATE.init(); {60839#true} is VALID [2022-04-08 13:26:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 52 proven. 176 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-08 13:26:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488992119] [2022-04-08 13:26:53,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85323344] [2022-04-08 13:26:53,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85323344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:26:53,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:26:53,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 13:26:53,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:53,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430174963] [2022-04-08 13:26:53,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430174963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:53,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:53,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 13:26:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530797549] [2022-04-08 13:26:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 182 [2022-04-08 13:26:53,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:53,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-08 13:26:53,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:53,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 13:26:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 13:26:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 13:26:53,645 INFO L87 Difference]: Start difference. First operand 535 states and 583 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-08 13:26:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:55,565 INFO L93 Difference]: Finished difference Result 629 states and 691 transitions. [2022-04-08 13:26:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 13:26:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 182 [2022-04-08 13:26:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:26:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-08 13:26:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-08 13:26:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-08 13:26:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-08 13:26:55,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 250 transitions. [2022-04-08 13:26:55,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:55,783 INFO L225 Difference]: With dead ends: 629 [2022-04-08 13:26:55,783 INFO L226 Difference]: Without dead ends: 606 [2022-04-08 13:26:55,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=369, Invalid=561, Unknown=0, NotChecked=0, Total=930 [2022-04-08 13:26:55,784 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 147 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:55,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 284 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 13:26:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-04-08 13:26:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 605. [2022-04-08 13:26:56,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:56,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-08 13:26:56,790 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-08 13:26:56,790 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-08 13:26:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:56,801 INFO L93 Difference]: Finished difference Result 606 states and 662 transitions. [2022-04-08 13:26:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 662 transitions. [2022-04-08 13:26:56,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:56,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:56,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 606 states. [2022-04-08 13:26:56,802 INFO L87 Difference]: Start difference. First operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 606 states. [2022-04-08 13:26:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:56,813 INFO L93 Difference]: Finished difference Result 606 states and 662 transitions. [2022-04-08 13:26:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 662 transitions. [2022-04-08 13:26:56,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:56,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:56,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:56,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 415 states have (on average 1.0843373493975903) internal successors, (450), 422 states have internal predecessors, (450), 107 states have call successors, (107), 84 states have call predecessors, (107), 82 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-08 13:26:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 661 transitions. [2022-04-08 13:26:56,828 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 661 transitions. Word has length 182 [2022-04-08 13:26:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:56,829 INFO L478 AbstractCegarLoop]: Abstraction has 605 states and 661 transitions. [2022-04-08 13:26:56,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-08 13:26:56,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 661 transitions. [2022-04-08 13:26:58,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 661 edges. 661 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 661 transitions. [2022-04-08 13:26:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-08 13:26:58,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:58,065 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:26:58,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:58,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-08 13:26:58,266 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 21 times [2022-04-08 13:26:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:58,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412836827] [2022-04-08 13:27:02,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:27:02,351 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:27:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 22 times [2022-04-08 13:27:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:27:02,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728988538] [2022-04-08 13:27:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:27:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:27:02,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:27:02,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15753500] [2022-04-08 13:27:02,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:27:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:27:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:27:02,367 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:27:02,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 13:27:08,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:27:08,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:27:08,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 13:27:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:27:08,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:27:09,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {65648#true} call ULTIMATE.init(); {65648#true} is VALID [2022-04-08 13:27:09,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {65648#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; {65656#(<= ~counter~0 0)} is VALID [2022-04-08 13:27:09,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {65656#(<= ~counter~0 0)} assume true; {65656#(<= ~counter~0 0)} is VALID [2022-04-08 13:27:09,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65656#(<= ~counter~0 0)} {65648#true} #92#return; {65656#(<= ~counter~0 0)} is VALID [2022-04-08 13:27:09,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {65656#(<= ~counter~0 0)} call #t~ret7 := main(); {65656#(<= ~counter~0 0)} is VALID [2022-04-08 13:27:09,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {65656#(<= ~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; {65656#(<= ~counter~0 0)} is VALID [2022-04-08 13:27:09,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {65656#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {65672#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,119 INFO L272 TraceCheckUtils]: 8: Hoare triple {65672#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {65672#(<= ~counter~0 1)} ~cond := #in~cond; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {65672#(<= ~counter~0 1)} assume !(0 == ~cond); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {65672#(<= ~counter~0 1)} assume true; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,120 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65672#(<= ~counter~0 1)} {65672#(<= ~counter~0 1)} #78#return; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,121 INFO L272 TraceCheckUtils]: 13: Hoare triple {65672#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {65672#(<= ~counter~0 1)} ~cond := #in~cond; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {65672#(<= ~counter~0 1)} assume !(0 == ~cond); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {65672#(<= ~counter~0 1)} assume true; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,122 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {65672#(<= ~counter~0 1)} {65672#(<= ~counter~0 1)} #80#return; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,122 INFO L272 TraceCheckUtils]: 18: Hoare triple {65672#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {65672#(<= ~counter~0 1)} ~cond := #in~cond; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {65672#(<= ~counter~0 1)} assume !(0 == ~cond); {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {65672#(<= ~counter~0 1)} assume true; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,124 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65672#(<= ~counter~0 1)} {65672#(<= ~counter~0 1)} #82#return; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {65672#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65672#(<= ~counter~0 1)} is VALID [2022-04-08 13:27:09,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {65672#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {65727#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,125 INFO L272 TraceCheckUtils]: 26: Hoare triple {65727#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {65727#(<= ~counter~0 2)} ~cond := #in~cond; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {65727#(<= ~counter~0 2)} assume !(0 == ~cond); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {65727#(<= ~counter~0 2)} assume true; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,126 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {65727#(<= ~counter~0 2)} {65727#(<= ~counter~0 2)} #78#return; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,127 INFO L272 TraceCheckUtils]: 31: Hoare triple {65727#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {65727#(<= ~counter~0 2)} ~cond := #in~cond; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {65727#(<= ~counter~0 2)} assume !(0 == ~cond); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {65727#(<= ~counter~0 2)} assume true; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,128 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {65727#(<= ~counter~0 2)} {65727#(<= ~counter~0 2)} #80#return; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,128 INFO L272 TraceCheckUtils]: 36: Hoare triple {65727#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {65727#(<= ~counter~0 2)} ~cond := #in~cond; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {65727#(<= ~counter~0 2)} assume !(0 == ~cond); {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {65727#(<= ~counter~0 2)} assume true; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,130 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65727#(<= ~counter~0 2)} {65727#(<= ~counter~0 2)} #82#return; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {65727#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65727#(<= ~counter~0 2)} is VALID [2022-04-08 13:27:09,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {65727#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {65782#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,131 INFO L272 TraceCheckUtils]: 44: Hoare triple {65782#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {65782#(<= ~counter~0 3)} ~cond := #in~cond; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {65782#(<= ~counter~0 3)} assume !(0 == ~cond); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {65782#(<= ~counter~0 3)} assume true; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,132 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {65782#(<= ~counter~0 3)} {65782#(<= ~counter~0 3)} #78#return; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,133 INFO L272 TraceCheckUtils]: 49: Hoare triple {65782#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {65782#(<= ~counter~0 3)} ~cond := #in~cond; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {65782#(<= ~counter~0 3)} assume !(0 == ~cond); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {65782#(<= ~counter~0 3)} assume true; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,134 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {65782#(<= ~counter~0 3)} {65782#(<= ~counter~0 3)} #80#return; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,135 INFO L272 TraceCheckUtils]: 54: Hoare triple {65782#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {65782#(<= ~counter~0 3)} ~cond := #in~cond; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {65782#(<= ~counter~0 3)} assume !(0 == ~cond); {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {65782#(<= ~counter~0 3)} assume true; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,136 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {65782#(<= ~counter~0 3)} {65782#(<= ~counter~0 3)} #82#return; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {65782#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65782#(<= ~counter~0 3)} is VALID [2022-04-08 13:27:09,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {65782#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {65837#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,137 INFO L272 TraceCheckUtils]: 62: Hoare triple {65837#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {65837#(<= ~counter~0 4)} ~cond := #in~cond; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {65837#(<= ~counter~0 4)} assume !(0 == ~cond); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {65837#(<= ~counter~0 4)} assume true; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,139 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {65837#(<= ~counter~0 4)} {65837#(<= ~counter~0 4)} #78#return; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,139 INFO L272 TraceCheckUtils]: 67: Hoare triple {65837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {65837#(<= ~counter~0 4)} ~cond := #in~cond; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {65837#(<= ~counter~0 4)} assume !(0 == ~cond); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {65837#(<= ~counter~0 4)} assume true; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,140 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65837#(<= ~counter~0 4)} {65837#(<= ~counter~0 4)} #80#return; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,141 INFO L272 TraceCheckUtils]: 72: Hoare triple {65837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {65837#(<= ~counter~0 4)} ~cond := #in~cond; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {65837#(<= ~counter~0 4)} assume !(0 == ~cond); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {65837#(<= ~counter~0 4)} assume true; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,142 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {65837#(<= ~counter~0 4)} {65837#(<= ~counter~0 4)} #82#return; {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {65837#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {65837#(<= ~counter~0 4)} is VALID [2022-04-08 13:27:09,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {65837#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {65892#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,144 INFO L272 TraceCheckUtils]: 80: Hoare triple {65892#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {65892#(<= ~counter~0 5)} ~cond := #in~cond; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {65892#(<= ~counter~0 5)} assume !(0 == ~cond); {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {65892#(<= ~counter~0 5)} assume true; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,145 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {65892#(<= ~counter~0 5)} {65892#(<= ~counter~0 5)} #84#return; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,145 INFO L272 TraceCheckUtils]: 85: Hoare triple {65892#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,146 INFO L290 TraceCheckUtils]: 86: Hoare triple {65892#(<= ~counter~0 5)} ~cond := #in~cond; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,146 INFO L290 TraceCheckUtils]: 87: Hoare triple {65892#(<= ~counter~0 5)} assume !(0 == ~cond); {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,146 INFO L290 TraceCheckUtils]: 88: Hoare triple {65892#(<= ~counter~0 5)} assume true; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,147 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {65892#(<= ~counter~0 5)} {65892#(<= ~counter~0 5)} #86#return; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {65892#(<= ~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); {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {65892#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65892#(<= ~counter~0 5)} is VALID [2022-04-08 13:27:09,148 INFO L290 TraceCheckUtils]: 92: Hoare triple {65892#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,148 INFO L290 TraceCheckUtils]: 93: Hoare triple {65935#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,149 INFO L272 TraceCheckUtils]: 94: Hoare triple {65935#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {65935#(<= ~counter~0 6)} ~cond := #in~cond; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,149 INFO L290 TraceCheckUtils]: 96: Hoare triple {65935#(<= ~counter~0 6)} assume !(0 == ~cond); {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,149 INFO L290 TraceCheckUtils]: 97: Hoare triple {65935#(<= ~counter~0 6)} assume true; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,150 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {65935#(<= ~counter~0 6)} {65935#(<= ~counter~0 6)} #84#return; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,150 INFO L272 TraceCheckUtils]: 99: Hoare triple {65935#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {65935#(<= ~counter~0 6)} ~cond := #in~cond; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,151 INFO L290 TraceCheckUtils]: 101: Hoare triple {65935#(<= ~counter~0 6)} assume !(0 == ~cond); {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,151 INFO L290 TraceCheckUtils]: 102: Hoare triple {65935#(<= ~counter~0 6)} assume true; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,151 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65935#(<= ~counter~0 6)} {65935#(<= ~counter~0 6)} #86#return; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {65935#(<= ~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); {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {65935#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65935#(<= ~counter~0 6)} is VALID [2022-04-08 13:27:09,153 INFO L290 TraceCheckUtils]: 106: Hoare triple {65935#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,153 INFO L290 TraceCheckUtils]: 107: Hoare triple {65978#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,153 INFO L272 TraceCheckUtils]: 108: Hoare triple {65978#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,154 INFO L290 TraceCheckUtils]: 109: Hoare triple {65978#(<= ~counter~0 7)} ~cond := #in~cond; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,154 INFO L290 TraceCheckUtils]: 110: Hoare triple {65978#(<= ~counter~0 7)} assume !(0 == ~cond); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,154 INFO L290 TraceCheckUtils]: 111: Hoare triple {65978#(<= ~counter~0 7)} assume true; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,155 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {65978#(<= ~counter~0 7)} {65978#(<= ~counter~0 7)} #84#return; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,155 INFO L272 TraceCheckUtils]: 113: Hoare triple {65978#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,155 INFO L290 TraceCheckUtils]: 114: Hoare triple {65978#(<= ~counter~0 7)} ~cond := #in~cond; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,156 INFO L290 TraceCheckUtils]: 115: Hoare triple {65978#(<= ~counter~0 7)} assume !(0 == ~cond); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,156 INFO L290 TraceCheckUtils]: 116: Hoare triple {65978#(<= ~counter~0 7)} assume true; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,156 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {65978#(<= ~counter~0 7)} {65978#(<= ~counter~0 7)} #86#return; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,157 INFO L290 TraceCheckUtils]: 118: Hoare triple {65978#(<= ~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); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,157 INFO L290 TraceCheckUtils]: 119: Hoare triple {65978#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,158 INFO L290 TraceCheckUtils]: 120: Hoare triple {65978#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,158 INFO L290 TraceCheckUtils]: 121: Hoare triple {66021#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,158 INFO L272 TraceCheckUtils]: 122: Hoare triple {66021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,159 INFO L290 TraceCheckUtils]: 123: Hoare triple {66021#(<= ~counter~0 8)} ~cond := #in~cond; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,159 INFO L290 TraceCheckUtils]: 124: Hoare triple {66021#(<= ~counter~0 8)} assume !(0 == ~cond); {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,159 INFO L290 TraceCheckUtils]: 125: Hoare triple {66021#(<= ~counter~0 8)} assume true; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,160 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {66021#(<= ~counter~0 8)} {66021#(<= ~counter~0 8)} #84#return; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,160 INFO L272 TraceCheckUtils]: 127: Hoare triple {66021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,160 INFO L290 TraceCheckUtils]: 128: Hoare triple {66021#(<= ~counter~0 8)} ~cond := #in~cond; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,161 INFO L290 TraceCheckUtils]: 129: Hoare triple {66021#(<= ~counter~0 8)} assume !(0 == ~cond); {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,161 INFO L290 TraceCheckUtils]: 130: Hoare triple {66021#(<= ~counter~0 8)} assume true; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,161 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {66021#(<= ~counter~0 8)} {66021#(<= ~counter~0 8)} #86#return; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,161 INFO L290 TraceCheckUtils]: 132: Hoare triple {66021#(<= ~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); {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,162 INFO L290 TraceCheckUtils]: 133: Hoare triple {66021#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,162 INFO L290 TraceCheckUtils]: 134: Hoare triple {66021#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,163 INFO L290 TraceCheckUtils]: 135: Hoare triple {66064#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,163 INFO L272 TraceCheckUtils]: 136: Hoare triple {66064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,163 INFO L290 TraceCheckUtils]: 137: Hoare triple {66064#(<= ~counter~0 9)} ~cond := #in~cond; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,164 INFO L290 TraceCheckUtils]: 138: Hoare triple {66064#(<= ~counter~0 9)} assume !(0 == ~cond); {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,164 INFO L290 TraceCheckUtils]: 139: Hoare triple {66064#(<= ~counter~0 9)} assume true; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,164 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {66064#(<= ~counter~0 9)} {66064#(<= ~counter~0 9)} #84#return; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,165 INFO L272 TraceCheckUtils]: 141: Hoare triple {66064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,165 INFO L290 TraceCheckUtils]: 142: Hoare triple {66064#(<= ~counter~0 9)} ~cond := #in~cond; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,165 INFO L290 TraceCheckUtils]: 143: Hoare triple {66064#(<= ~counter~0 9)} assume !(0 == ~cond); {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,166 INFO L290 TraceCheckUtils]: 144: Hoare triple {66064#(<= ~counter~0 9)} assume true; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,166 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {66064#(<= ~counter~0 9)} {66064#(<= ~counter~0 9)} #86#return; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,166 INFO L290 TraceCheckUtils]: 146: Hoare triple {66064#(<= ~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); {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,167 INFO L290 TraceCheckUtils]: 147: Hoare triple {66064#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,167 INFO L290 TraceCheckUtils]: 148: Hoare triple {66064#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,168 INFO L290 TraceCheckUtils]: 149: Hoare triple {66107#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,168 INFO L272 TraceCheckUtils]: 150: Hoare triple {66107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,168 INFO L290 TraceCheckUtils]: 151: Hoare triple {66107#(<= ~counter~0 10)} ~cond := #in~cond; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,169 INFO L290 TraceCheckUtils]: 152: Hoare triple {66107#(<= ~counter~0 10)} assume !(0 == ~cond); {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,169 INFO L290 TraceCheckUtils]: 153: Hoare triple {66107#(<= ~counter~0 10)} assume true; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,169 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {66107#(<= ~counter~0 10)} {66107#(<= ~counter~0 10)} #84#return; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,170 INFO L272 TraceCheckUtils]: 155: Hoare triple {66107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,170 INFO L290 TraceCheckUtils]: 156: Hoare triple {66107#(<= ~counter~0 10)} ~cond := #in~cond; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,170 INFO L290 TraceCheckUtils]: 157: Hoare triple {66107#(<= ~counter~0 10)} assume !(0 == ~cond); {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,170 INFO L290 TraceCheckUtils]: 158: Hoare triple {66107#(<= ~counter~0 10)} assume true; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,171 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {66107#(<= ~counter~0 10)} {66107#(<= ~counter~0 10)} #86#return; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,171 INFO L290 TraceCheckUtils]: 160: Hoare triple {66107#(<= ~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); {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,171 INFO L290 TraceCheckUtils]: 161: Hoare triple {66107#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,172 INFO L290 TraceCheckUtils]: 162: Hoare triple {66107#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,172 INFO L290 TraceCheckUtils]: 163: Hoare triple {66150#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,173 INFO L272 TraceCheckUtils]: 164: Hoare triple {66150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,173 INFO L290 TraceCheckUtils]: 165: Hoare triple {66150#(<= ~counter~0 11)} ~cond := #in~cond; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,173 INFO L290 TraceCheckUtils]: 166: Hoare triple {66150#(<= ~counter~0 11)} assume !(0 == ~cond); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,174 INFO L290 TraceCheckUtils]: 167: Hoare triple {66150#(<= ~counter~0 11)} assume true; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,174 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {66150#(<= ~counter~0 11)} {66150#(<= ~counter~0 11)} #84#return; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,175 INFO L272 TraceCheckUtils]: 169: Hoare triple {66150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,175 INFO L290 TraceCheckUtils]: 170: Hoare triple {66150#(<= ~counter~0 11)} ~cond := #in~cond; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,175 INFO L290 TraceCheckUtils]: 171: Hoare triple {66150#(<= ~counter~0 11)} assume !(0 == ~cond); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,175 INFO L290 TraceCheckUtils]: 172: Hoare triple {66150#(<= ~counter~0 11)} assume true; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,176 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {66150#(<= ~counter~0 11)} {66150#(<= ~counter~0 11)} #86#return; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,176 INFO L290 TraceCheckUtils]: 174: Hoare triple {66150#(<= ~counter~0 11)} 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); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,176 INFO L290 TraceCheckUtils]: 175: Hoare triple {66150#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,177 INFO L290 TraceCheckUtils]: 176: Hoare triple {66150#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,177 INFO L290 TraceCheckUtils]: 177: Hoare triple {66193#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,178 INFO L272 TraceCheckUtils]: 178: Hoare triple {66193#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,178 INFO L290 TraceCheckUtils]: 179: Hoare triple {66193#(<= ~counter~0 12)} ~cond := #in~cond; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,178 INFO L290 TraceCheckUtils]: 180: Hoare triple {66193#(<= ~counter~0 12)} assume !(0 == ~cond); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,179 INFO L290 TraceCheckUtils]: 181: Hoare triple {66193#(<= ~counter~0 12)} assume true; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,179 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {66193#(<= ~counter~0 12)} {66193#(<= ~counter~0 12)} #84#return; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,180 INFO L272 TraceCheckUtils]: 183: Hoare triple {66193#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,180 INFO L290 TraceCheckUtils]: 184: Hoare triple {66193#(<= ~counter~0 12)} ~cond := #in~cond; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,180 INFO L290 TraceCheckUtils]: 185: Hoare triple {66193#(<= ~counter~0 12)} assume !(0 == ~cond); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,180 INFO L290 TraceCheckUtils]: 186: Hoare triple {66193#(<= ~counter~0 12)} assume true; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,181 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {66193#(<= ~counter~0 12)} {66193#(<= ~counter~0 12)} #86#return; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,181 INFO L290 TraceCheckUtils]: 188: Hoare triple {66193#(<= ~counter~0 12)} 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); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,181 INFO L290 TraceCheckUtils]: 189: Hoare triple {66193#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,182 INFO L290 TraceCheckUtils]: 190: Hoare triple {66193#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66236#(<= |main_#t~post6| 12)} is VALID [2022-04-08 13:27:09,182 INFO L290 TraceCheckUtils]: 191: Hoare triple {66236#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {65649#false} is VALID [2022-04-08 13:27:09,182 INFO L272 TraceCheckUtils]: 192: Hoare triple {65649#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {65649#false} is VALID [2022-04-08 13:27:09,182 INFO L290 TraceCheckUtils]: 193: Hoare triple {65649#false} ~cond := #in~cond; {65649#false} is VALID [2022-04-08 13:27:09,182 INFO L290 TraceCheckUtils]: 194: Hoare triple {65649#false} assume 0 == ~cond; {65649#false} is VALID [2022-04-08 13:27:09,182 INFO L290 TraceCheckUtils]: 195: Hoare triple {65649#false} assume !false; {65649#false} is VALID [2022-04-08 13:27:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 56 proven. 1652 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-04-08 13:27:09,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:27:09,838 INFO L290 TraceCheckUtils]: 195: Hoare triple {65649#false} assume !false; {65649#false} is VALID [2022-04-08 13:27:09,838 INFO L290 TraceCheckUtils]: 194: Hoare triple {65649#false} assume 0 == ~cond; {65649#false} is VALID [2022-04-08 13:27:09,838 INFO L290 TraceCheckUtils]: 193: Hoare triple {65649#false} ~cond := #in~cond; {65649#false} is VALID [2022-04-08 13:27:09,838 INFO L272 TraceCheckUtils]: 192: Hoare triple {65649#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {65649#false} is VALID [2022-04-08 13:27:09,838 INFO L290 TraceCheckUtils]: 191: Hoare triple {66264#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {65649#false} is VALID [2022-04-08 13:27:09,838 INFO L290 TraceCheckUtils]: 190: Hoare triple {66268#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66264#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:27:09,839 INFO L290 TraceCheckUtils]: 189: Hoare triple {66268#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,839 INFO L290 TraceCheckUtils]: 188: Hoare triple {66268#(< ~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); {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,839 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {65648#true} {66268#(< ~counter~0 20)} #86#return; {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,839 INFO L290 TraceCheckUtils]: 186: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,839 INFO L290 TraceCheckUtils]: 185: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L290 TraceCheckUtils]: 184: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L272 TraceCheckUtils]: 183: Hoare triple {66268#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {65648#true} {66268#(< ~counter~0 20)} #84#return; {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,840 INFO L290 TraceCheckUtils]: 181: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L290 TraceCheckUtils]: 180: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L290 TraceCheckUtils]: 179: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,840 INFO L272 TraceCheckUtils]: 178: Hoare triple {66268#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,841 INFO L290 TraceCheckUtils]: 177: Hoare triple {66268#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,842 INFO L290 TraceCheckUtils]: 176: Hoare triple {66311#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66268#(< ~counter~0 20)} is VALID [2022-04-08 13:27:09,842 INFO L290 TraceCheckUtils]: 175: Hoare triple {66311#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,842 INFO L290 TraceCheckUtils]: 174: Hoare triple {66311#(< ~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); {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,843 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {65648#true} {66311#(< ~counter~0 19)} #86#return; {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,843 INFO L290 TraceCheckUtils]: 172: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,843 INFO L290 TraceCheckUtils]: 171: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,843 INFO L290 TraceCheckUtils]: 170: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,843 INFO L272 TraceCheckUtils]: 169: Hoare triple {66311#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,843 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {65648#true} {66311#(< ~counter~0 19)} #84#return; {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,843 INFO L290 TraceCheckUtils]: 167: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,844 INFO L290 TraceCheckUtils]: 166: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,844 INFO L290 TraceCheckUtils]: 165: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,844 INFO L272 TraceCheckUtils]: 164: Hoare triple {66311#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,844 INFO L290 TraceCheckUtils]: 163: Hoare triple {66311#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,845 INFO L290 TraceCheckUtils]: 162: Hoare triple {66354#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66311#(< ~counter~0 19)} is VALID [2022-04-08 13:27:09,845 INFO L290 TraceCheckUtils]: 161: Hoare triple {66354#(< ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,845 INFO L290 TraceCheckUtils]: 160: Hoare triple {66354#(< ~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); {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,845 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {65648#true} {66354#(< ~counter~0 18)} #86#return; {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 158: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 157: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 156: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L272 TraceCheckUtils]: 155: Hoare triple {66354#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {65648#true} {66354#(< ~counter~0 18)} #84#return; {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 153: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 152: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L290 TraceCheckUtils]: 151: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,846 INFO L272 TraceCheckUtils]: 150: Hoare triple {66354#(< ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,847 INFO L290 TraceCheckUtils]: 149: Hoare triple {66354#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,847 INFO L290 TraceCheckUtils]: 148: Hoare triple {66397#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66354#(< ~counter~0 18)} is VALID [2022-04-08 13:27:09,848 INFO L290 TraceCheckUtils]: 147: Hoare triple {66397#(< ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,848 INFO L290 TraceCheckUtils]: 146: Hoare triple {66397#(< ~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); {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,848 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {65648#true} {66397#(< ~counter~0 17)} #86#return; {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,848 INFO L290 TraceCheckUtils]: 144: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,848 INFO L290 TraceCheckUtils]: 143: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,848 INFO L290 TraceCheckUtils]: 142: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,848 INFO L272 TraceCheckUtils]: 141: Hoare triple {66397#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,849 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {65648#true} {66397#(< ~counter~0 17)} #84#return; {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,849 INFO L290 TraceCheckUtils]: 139: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,849 INFO L290 TraceCheckUtils]: 138: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,849 INFO L290 TraceCheckUtils]: 137: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,849 INFO L272 TraceCheckUtils]: 136: Hoare triple {66397#(< ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,849 INFO L290 TraceCheckUtils]: 135: Hoare triple {66397#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,850 INFO L290 TraceCheckUtils]: 134: Hoare triple {66440#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66397#(< ~counter~0 17)} is VALID [2022-04-08 13:27:09,850 INFO L290 TraceCheckUtils]: 133: Hoare triple {66440#(< ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,850 INFO L290 TraceCheckUtils]: 132: Hoare triple {66440#(< ~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); {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,851 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {65648#true} {66440#(< ~counter~0 16)} #86#return; {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,851 INFO L290 TraceCheckUtils]: 130: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,851 INFO L272 TraceCheckUtils]: 127: Hoare triple {66440#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,852 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {65648#true} {66440#(< ~counter~0 16)} #84#return; {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,852 INFO L290 TraceCheckUtils]: 125: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,852 INFO L290 TraceCheckUtils]: 124: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,852 INFO L290 TraceCheckUtils]: 123: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,852 INFO L272 TraceCheckUtils]: 122: Hoare triple {66440#(< ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,852 INFO L290 TraceCheckUtils]: 121: Hoare triple {66440#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,853 INFO L290 TraceCheckUtils]: 120: Hoare triple {66483#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66440#(< ~counter~0 16)} is VALID [2022-04-08 13:27:09,853 INFO L290 TraceCheckUtils]: 119: Hoare triple {66483#(< ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,853 INFO L290 TraceCheckUtils]: 118: Hoare triple {66483#(< ~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); {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,853 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {65648#true} {66483#(< ~counter~0 15)} #86#return; {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 116: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 115: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L272 TraceCheckUtils]: 113: Hoare triple {66483#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {65648#true} {66483#(< ~counter~0 15)} #84#return; {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 111: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 110: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L290 TraceCheckUtils]: 109: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,854 INFO L272 TraceCheckUtils]: 108: Hoare triple {66483#(< ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,855 INFO L290 TraceCheckUtils]: 107: Hoare triple {66483#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,855 INFO L290 TraceCheckUtils]: 106: Hoare triple {66526#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66483#(< ~counter~0 15)} is VALID [2022-04-08 13:27:09,856 INFO L290 TraceCheckUtils]: 105: Hoare triple {66526#(< ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,856 INFO L290 TraceCheckUtils]: 104: Hoare triple {66526#(< ~counter~0 14)} 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); {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,856 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65648#true} {66526#(< ~counter~0 14)} #86#return; {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L272 TraceCheckUtils]: 99: Hoare triple {66526#(< ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {65648#true} {66526#(< ~counter~0 14)} #84#return; {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,857 INFO L290 TraceCheckUtils]: 97: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L290 TraceCheckUtils]: 96: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L290 TraceCheckUtils]: 95: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L272 TraceCheckUtils]: 94: Hoare triple {66526#(< ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {66526#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {66193#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66526#(< ~counter~0 14)} is VALID [2022-04-08 13:27:09,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {66193#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {66193#(<= ~counter~0 12)} 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); {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,859 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {65648#true} {66193#(<= ~counter~0 12)} #86#return; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,859 INFO L290 TraceCheckUtils]: 88: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,859 INFO L290 TraceCheckUtils]: 87: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,859 INFO L272 TraceCheckUtils]: 85: Hoare triple {66193#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,860 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {65648#true} {66193#(<= ~counter~0 12)} #84#return; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,860 INFO L272 TraceCheckUtils]: 80: Hoare triple {66193#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {66193#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {66150#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66193#(<= ~counter~0 12)} is VALID [2022-04-08 13:27:09,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {66150#(<= ~counter~0 11)} assume !(~r~0 >= ~d~0); {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,861 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {65648#true} {66150#(<= ~counter~0 11)} #82#return; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L272 TraceCheckUtils]: 72: Hoare triple {66150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65648#true} {66150#(<= ~counter~0 11)} #80#return; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,862 INFO L272 TraceCheckUtils]: 67: Hoare triple {66150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,863 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {65648#true} {66150#(<= ~counter~0 11)} #78#return; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,863 INFO L272 TraceCheckUtils]: 62: Hoare triple {66150#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {66150#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {66107#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66150#(<= ~counter~0 11)} is VALID [2022-04-08 13:27:09,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {66107#(<= ~counter~0 10)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,864 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {65648#true} {66107#(<= ~counter~0 10)} #82#return; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L272 TraceCheckUtils]: 54: Hoare triple {66107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {65648#true} {66107#(<= ~counter~0 10)} #80#return; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,865 INFO L272 TraceCheckUtils]: 49: Hoare triple {66107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,866 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {65648#true} {66107#(<= ~counter~0 10)} #78#return; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,866 INFO L272 TraceCheckUtils]: 44: Hoare triple {66107#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {66107#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {66064#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66107#(<= ~counter~0 10)} is VALID [2022-04-08 13:27:09,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {66064#(<= ~counter~0 9)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,867 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65648#true} {66064#(<= ~counter~0 9)} #82#return; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L272 TraceCheckUtils]: 36: Hoare triple {66064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {65648#true} {66064#(<= ~counter~0 9)} #80#return; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,868 INFO L272 TraceCheckUtils]: 31: Hoare triple {66064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,869 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {65648#true} {66064#(<= ~counter~0 9)} #78#return; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {66064#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {66064#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {66021#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66064#(<= ~counter~0 9)} is VALID [2022-04-08 13:27:09,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {66021#(<= ~counter~0 8)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,871 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65648#true} {66021#(<= ~counter~0 8)} #82#return; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L272 TraceCheckUtils]: 18: Hoare triple {66021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {65648#true} {66021#(<= ~counter~0 8)} #80#return; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,871 INFO L272 TraceCheckUtils]: 13: Hoare triple {66021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,872 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65648#true} {66021#(<= ~counter~0 8)} #78#return; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {65648#true} assume true; {65648#true} is VALID [2022-04-08 13:27:09,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {65648#true} assume !(0 == ~cond); {65648#true} is VALID [2022-04-08 13:27:09,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {65648#true} ~cond := #in~cond; {65648#true} is VALID [2022-04-08 13:27:09,872 INFO L272 TraceCheckUtils]: 8: Hoare triple {66021#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65648#true} is VALID [2022-04-08 13:27:09,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {66021#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {65978#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66021#(<= ~counter~0 8)} is VALID [2022-04-08 13:27:09,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {65978#(<= ~counter~0 7)} 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; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {65978#(<= ~counter~0 7)} call #t~ret7 := main(); {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65978#(<= ~counter~0 7)} {65648#true} #92#return; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {65978#(<= ~counter~0 7)} assume true; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {65648#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; {65978#(<= ~counter~0 7)} is VALID [2022-04-08 13:27:09,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {65648#true} call ULTIMATE.init(); {65648#true} is VALID [2022-04-08 13:27:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 56 proven. 220 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2022-04-08 13:27:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:27:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728988538] [2022-04-08 13:27:09,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:27:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15753500] [2022-04-08 13:27:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15753500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:27:09,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:27:09,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 13:27:09,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:27:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412836827] [2022-04-08 13:27:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412836827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:27:09,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:27:09,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 13:27:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303467244] [2022-04-08 13:27:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:27:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) Word has length 196 [2022-04-08 13:27:09,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:27:09,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) [2022-04-08 13:27:10,027 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-08 13:27:10,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 13:27:10,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:27:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 13:27:10,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 13:27:10,028 INFO L87 Difference]: Start difference. First operand 605 states and 661 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) [2022-04-08 13:27:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:12,156 INFO L93 Difference]: Finished difference Result 699 states and 769 transitions. [2022-04-08 13:27:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 13:27:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) Word has length 196 [2022-04-08 13:27:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:27:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) [2022-04-08 13:27:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2022-04-08 13:27:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) [2022-04-08 13:27:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2022-04-08 13:27:12,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 272 transitions. [2022-04-08 13:27:12,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:27:12,400 INFO L225 Difference]: With dead ends: 699 [2022-04-08 13:27:12,400 INFO L226 Difference]: Without dead ends: 676 [2022-04-08 13:27:12,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2022-04-08 13:27:12,401 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 147 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 13:27:12,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 13:27:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-04-08 13:27:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 675. [2022-04-08 13:27:13,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:27:13,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 676 states. Second operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 13:27:13,148 INFO L74 IsIncluded]: Start isIncluded. First operand 676 states. Second operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 13:27:13,149 INFO L87 Difference]: Start difference. First operand 676 states. Second operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 13:27:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:13,162 INFO L93 Difference]: Finished difference Result 676 states and 740 transitions. [2022-04-08 13:27:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 740 transitions. [2022-04-08 13:27:13,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:27:13,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:27:13,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) Second operand 676 states. [2022-04-08 13:27:13,164 INFO L87 Difference]: Start difference. First operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) Second operand 676 states. [2022-04-08 13:27:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:13,177 INFO L93 Difference]: Finished difference Result 676 states and 740 transitions. [2022-04-08 13:27:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 740 transitions. [2022-04-08 13:27:13,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:27:13,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:27:13,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:27:13,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:27:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 463 states have (on average 1.0842332613390928) internal successors, (502), 471 states have internal predecessors, (502), 120 states have call successors, (120), 93 states have call predecessors, (120), 91 states have return successors, (117), 110 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 13:27:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 739 transitions. [2022-04-08 13:27:13,197 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 739 transitions. Word has length 196 [2022-04-08 13:27:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:27:13,197 INFO L478 AbstractCegarLoop]: Abstraction has 675 states and 739 transitions. [2022-04-08 13:27:13,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (31), 15 states have call predecessors, (31), 13 states have return successors, (29), 13 states have call predecessors, (29), 13 states have call successors, (29) [2022-04-08 13:27:13,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 675 states and 739 transitions.